Bentley-Ottmann algorithm
From Wikipedia, the free encyclopedia
The Bentley-Ottmann algorithm is a sweep line algorithm for solving the line segment intersection problem 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.
[edit] See also
- Scan-line rendering
- Shamos-Hoey algorithm
[edit] External links
- Bentley-Ottmann algorithm at geometryalgorithms.com
 |
This geometry-related article is a stub. You can help Wikipedia by expanding it. |
