Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry

Abstract

We discuss interval techniques for speeding 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. Furthermore we show how to use our interval techniques for exact linear optimization problems of low dimension as they arise in geometric computing. We validate our approach experimentally, comparing it with other static, dynamic and semi-static filters.
Fichier principal
Vignette du fichier
bbp98.pdf (261.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00344516 , version 1 (05-12-2008)

Identifiers

  • HAL Id : inria-00344516 , version 1

Cite

Hervé Brönnimann, Christoph Burnikel, Sylvain Pion. Interval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry. 14th Annual ACM Symposium on Computational Geometry (SCG), Jun 1998, Minneapolis, United States. pp.165-174. ⟨inria-00344516⟩

Collections

INRIA INRIA2
98 View
119 Download

Share

Gmail Facebook Twitter LinkedIn More