Reporting intersections among thick objects.

DOI10.1016/S0020-0190(02)00347-2zbMath1042.68122OpenAlexW2040292070MaRDI QIDQ1853186

Antoine Vigneron

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00347-2

zbMATH Keywords

AlgorithmsComputational geometryRobustnessDivide and conquerGeometric intersection problems

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Uses Software

• CGAL
• Quicksort

Cites Work

• The complexity of finding fixed-radius near neighbors
• Efficient algorithms for line and curve segment intersection using restricted predicates
• Reporting curve segment intersections using restricted predicates
• Algorithms for proximity problems in higher dimensions
• A new approach to rectangle intersections
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• An optimal algorithm for intersecting line segments in the plane
• On the design of CGAL a computational geometry algorithms library
• Fast software for box intersections
• Quicksort
• An elementary algorithm for reporting intersections of red/blue curve segments

This page was built for publication: Reporting intersections among thick objects.