Revision as of 11:17, 16 March 2008 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,134 edits * Shamos-Hoey algorithm ← Previous edit		Revision as of 11:18, 16 March 2008 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,134 edits a line segment intersection algorithm Next edit →
Line 1: The '''Bentley-Ottmann algorithm''' is a [[line segment intersection]] [[algorithm]] for finding the intersections of a set of [[line segment]]s 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