Skip to Main content Skip to Navigation
Journal articles

Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry

Abstract : We discuss floating-point filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques can be used to speed up the exact evaluation of geometric predicates and describe an efficient implementation of interval arithmetic that is strongly influenced by the rounding modes of the widely used IEEE 754 standard. Using this approach we engineer an efficient floating-point filter for the computation of the sign of a determinant that works for arbitrary dimensions. We validate our approach experimentally, comparing it with other static, dynamic and semi-static filters.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Sylvain Pion Connect in order to contact the contributor
Submitted on : Thursday, December 4, 2008 - 1:44:57 PM
Last modification on : Friday, February 4, 2022 - 3:11:14 AM
Long-term archiving on: : Monday, June 7, 2010 - 11:44:22 PM


Files produced by the author(s)


  • HAL Id : inria-00344281, version 1



Hervé Brönnimann, Christoph Burnikel, Sylvain Pion. Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. Discrete Applied Mathematics, Elsevier, 2001, pp.25-47. ⟨inria-00344281⟩



Record views


Files downloads