Revision as of 02:38, 11 November 2008 edit Amirshim (talk \| contribs) 2 edits →External links: - broken links ← Previous edit		Revision as of 04:31, 12 November 2008 edit undo David Eppstein (talk \| contribs) Autopatrolled, Administrators 235,660 edits named after Next edit →
Line 1: 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 ==

Bentley–Ottmann algorithm: Difference between revisions