Facts
Urlhttps://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm
Sources
Wikipedia: Bentley-Ottmann algorithm
Lead sectionQuote, Lead section
In computational geometry, the Bentley-Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments, i.e. it finds the intersection points (or, simply, intersections) of line segments.
Claims Backed By This Source (9 claims)
This source backs 9 claims across the atlas. As facts: 3 well-attested. As cited relationships: 4 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Algorithms, 7 claims: 2 well-attested, 3 holds, 2 general references.
- Pioneers, 1 claims: 1 holds.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.