Revision as of 11:18, 16 March 2008 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,137 edits a line segment intersection algorithm ← Previous edit		Revision as of 11:21, 16 March 2008 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,137 edits is a sweep line algorithm for solving the line segment intersection problem. Next edit →
Line 1: The '''Bentley-Ottmann algorithm''' is a [[sweep line ~~segment intersection]] [[~~algorithm]] for ~~finding~~solving the ~~intersections of a set of~~ [[line segment intersection]]s 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. == See also ==

Bentley–Ottmann algorithm: Difference between revisions