1.Previous
3.Next

in the plane in 1976. In particular, they described how a combination of the scanline approach with efficient data structures (self-balancing binary search trees) makes it possible to detect whether there are intersections among segments in the plane in time complexity of . The closely related Bentley-Ottmann algorithm uses a sweep line technique to report all intersections among any segments

1.Previous
3.Next