Pointed Binary Encompassing Trees

For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges lie in a halfplane defined by the incident input segment. Our algorithm runs in O(n log n) time which is known to be optimal in the algebraic computation tree model.

• Type: Conference
• Year: 2004
• Where: SWAT
• Authors: Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
• Keywords: Algorithms, Binary Encompassing Tree, Disjoint Line Segments, Incident Input Segment, SWAT 2004