COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
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...