Wikipedia

Bentley–Ottmann algorithm

This is an old revision of this page, as edited by David Eppstein (talk | contribs) at 03:57, 27 May 2009 (moved Bentley-Ottmann algorithm to Bentley–Ottmann algorithm: dash). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Bentley-Ottmann algorithm is a sweep line algorithm for solving the line segment intersection problem on a plane, named after Jon Bentley and Thomas A. Ottman. 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


 

This geometry-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Bentley–Ottmann_algorithm&oldid=292594161"