Jump to content

Bentley–Ottmann algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by The Anome (talk | contribs) at 11:15, 16 March 2008 (The '''Bentley-Ottmann algorithm''' is a line intersection algorithm). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The Bentley-Ottmann algorithm is a line intersection algorithm for finding the intersections of a set of line segments 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

Stub icon

This algorithms or data structures-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=198608091"