## Robust Plane Sweep for Intersecting Segments (1997)

Citations: | 24 - 2 self |

### BibTeX

@MISC{Boissonnat97robustplane,

author = {Jean-Daniel Boissonnat and Franco P. Preparata},

title = {Robust Plane Sweep for Intersecting Segments},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### 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...