The Bentley-Ottmann algorithm is a line intersection algorithm for finding the intersections of a set of line segments on a plane. It works by considering the intersections of the line segments with a "sweep" line which is moved progressively across the set of line segments.
See also
External links
- Bentley-Ottmann algorithm at geometryalgorithms.com
 | This geometry-related article is a stub. You can help Wikipedia by expanding it. |