Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Proceedings of the sixteenth annual symposium on Computational geometry
Root comparison techniques applied to computing the additively weighted Voronoi diagram
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal, Suboptimal, and Robust Algorithms for Proximity Graphs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Intersecting Red and Blue Line Segments in Optimal Time and Precision
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Optimal and suboptimal robust algorithms for proximity graphs
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Filtering with raster signatures
GIS '06 Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems
The unpredictable deviousness of models
Theoretical Computer Science
On the degree of standard geometric predicates for line transversals in 3D
Computational Geometry: Theory and Applications
Visibility-based modelling and control for network-based robotics
Pattern Recognition Letters
Computing the Implicit Voronoi Diagram in Triple Precision
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
An exact and efficient approach for computing a cell in an arrangement of quadrics
Computational Geometry: Theory and Applications - Special issue on robust geometric algorithms and their implementations
Proceedings of the twenty-sixth annual symposium on Computational geometry
Spatial Modelling for Mobile Robot's Vision-based Navigation
Journal of Intelligent and Robotic Systems
Algorithms for vector graphic optimization and compression
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Algebraic methods and arithmetic filtering for exact predicates on circle arcs
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
In this paper, we reexamine in the framework of robust computation the Bentley--Ottmann algorithm for reporting intersecting pairs of segments in the plane. This algorithm has been reported as being very sensitive to numerical errors. Indeed, a simple analysis reveals that it involves predicates of degree 5, presumably never evaluated exactly in most implementations. Within the exact-computation paradigm we introduce two models of computation aimed at replacing the conventional model of real-number arithmetic. The first model (predicate arithmetic) assumes the exact evaluation of the signs of algebraic expressions of some degree, and the second model (exact arithmetic) assumes the exact computation of the value of such (bounded-degree) expressions. We identify the characteristic geometric property enabling the correct report of all intersections by plane sweeps. Verification of this property involves only predicates of (optimal) degree 2, but its straightforward implementation appears highly inefficient. We then present algorithmic variants that have low degree under these models and achieve the same performance as the original Bentley--Ottmann algorithm. The technique is applicable to a more general case of curved segments.