An elementary algorithm for reporting intersections of red/blue curve segments

DOI10.1016/S0925-7721(01)00026-8zbMath0998.68192OpenAlexW2069470212MaRDI QIDQ5959559

Jean-Daniel Boissonnat, Antoine Vigneron

Publication date: 14 March 2002

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00026-8

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Line-segment intersection made in-place ⋮ Reporting intersections among thick objects.

Cites Work

• Unnamed Item
• Unnamed Item
• Towards exact geometric computation
• Range-restricted mergeable priority queues
• Axioms and hulls
• Efficient algorithms for line and curve segment intersection using restricted predicates
• Reporting curve segment intersections using restricted predicates
• Applications of random sampling in computational geometry. II
• Algorithms for Reporting and Counting Geometric Intersections
• A data structure for manipulating priority queues
• Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
• An optimal algorithm for intersecting line segments in the plane
• Robust Plane Sweep for Intersecting Segments
• Algebraic methods and arithmetic filtering for exact predicates on circle arcs