by Jean-daniel Boissonnat, Antoine Vigneron
Comput. Geom. Theory Appl
http://www.comp.nus.edu.sg/~antoine/redblue.ps.gz
Add To MetaCart
Abstract:
Let E r and E b be two sets of x-monotone and non-intersecting curve segments, E = E r [ E b and jEj = n. We give a new sweep-line algorithm that reports the k intersecting pairs of segments of E. Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simplest predicates that lead to subquadratic algorithms. Our algorithm is almost optimal in this restricted model of computation. Its time complexity is O(n log n + k log log n) and it requires O(n) space. 1
Citations
|
1541
|
Computational Geometry: An Introduction
– Preparata, Shamos
- 1985
|
|
345
|
Applications of random sampling in computational geometry
– Clarkson, Shor
- 1989
|
|
231
|
Algorithms for Reporting and Counting Geometric Intersections
– Bentley, Ottmann
- 1979
|
|
141
|
An optimal algorithm for intersecting line segments in the plane
– Chazelle, Edelsbrunner
- 1992
|
|
91
|
Towards exact geometric computation
– Yap
- 1997
|
|
54
|
Robust geometric computation
– Yap
- 2004
|
|
51
|
An optimal algorithm for finding segments intersections
– Balaban
- 1995
|
|
34
|
Robust proximity queries: An illustration of degree-driven algorithm design
– Liotta, Preparata, et al.
- 1997
|
|
29
|
A simple trapezoid sweep algorithm for reporting red/blue segment intersections
– Chan
- 1994
|
|
28
|
Preparata Robust plane sweep for intersecting segments
– Boissonnat, F
|
|
26
|
Robustness and precision issues in geometric computation
– Schirra
- 1999
|
|
21
|
Efficient algorithms for line and curve segment intersection using restricted predicates
– Boissonnat, Snoeyink
- 1999
|
|
14
|
Checking mergeable priority queues
– Bright, Sullivan
- 1994
|
|
13
|
Axioms and Hulls, volume 606
– Knuth
- 1992
|
|
9
|
Interval arithmetic: An efficient implementation and an application to computational geometry
– Pion
- 1999
|
|
8
|
A robust region approach to the computation of geometric graphs
– D'Amore, Franciosa, et al.
- 1998
|
|
4
|
Reporting curve segment intersections using restricted predicates
– Chan
- 2000
|
|
4
|
Monique Teillaud. Exact predicates for circle arcs arrangements
– Devillers, Fronville, et al.
- 2000
|
|
4
|
An optimal algorithm for nding segment intersections
– Balaban
- 1995
|
|
2
|
Algorithmes elementaires pour reporter les intersections d'objets courbes. Rapport de DEA algorithmique
– Vigneron
- 1999
|
