Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Applied Mathematics Year : 2001

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.
Fichier principal
Vignette du fichier
interval_journal-1.pdf (177.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00344281 , version 1 (04-12-2008)

Identifiers

  • HAL Id : inria-00344281 , version 1

Cite

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

Collections

INRIA INRIA2
68 View
570 Download

Share

Gmail Facebook X LinkedIn More