A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Interval arithmetic yields efficient dynamic filters for computational geometry
1998
Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98
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
doi:10.1145/276884.276903
dblp:conf/compgeom/BronnimannBP98
fatcat:q3vqqfrygnborhhz7opaju3dse