Line Segment Intersection: Computational Geometry, Line-Line Intersection, ¿-Net (computational geometry) - Brossura

Brossura

ISBN 10: 613324643X ISBN 13: 9786133246430

Casa editrice: OmniScriptum, 2026

Riassunto

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational geometry, the line segment intersection problem supplies a list of line segments in the plane and asks us to determine whether any two of them intersect, or cross. Naive algorithms examine each pair of segments, but this is highly inefficient, since most pairs of segments aren't anywhere close to one another in a typical input sequence. The most common, more efficient way to solve this problem is to use a sweep line algorithm, where we imagine a line sliding across the line segments and we track which line segments it intersects at each point in time using a dynamic data structure based on binary search trees. The Shamos-Hoey algorithm applies this principle to solve the line segment intersection detection problem, as stated above, of determining whether or not a set of line segments has an intersection; the Bentley-Ottmann algorithm works by the same principle to list all intersections in logarithmic time per intersection.

Dettagli dell'edizione

• Editore: OmniScriptum
• Data di pubblicazione: 2026
• Lingua: Inglese
• ISBN 10: 613324643X
• ISBN 13: 9786133246430
• Rilegatura: Copertina flessibile
• Numero di pagine: 80
• Redattore: Surhone Lambert M., Tennoe Mariam T., Henssonow Susan F.
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile