Robust Plane Sweep for Intersecting Segments

Jean-Daniel Boissonnat 1 Franco Preparata
1 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : 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 implementation. 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 straighforward 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.
Type de document :
RR-3270, INRIA. 1997
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:45:10
Dernière modification le : samedi 27 janvier 2018 - 01:31:29
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:46:02



  • HAL Id : inria-00073419, version 1



Jean-Daniel Boissonnat, Franco Preparata. Robust Plane Sweep for Intersecting Segments. RR-3270, INRIA. 1997. 〈inria-00073419〉



Consultations de la notice


Téléchargements de fichiers