Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates

@article{Shewchuk1997AdaptivePF,
  title={Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates},
  author={Jonathan Richard Shewchuk},
  journal={Discret. Comput. Geom.},
  year={1997},
  volume={18},
  pages={305-368}
}
  • J. Shewchuk
  • Published 1 October 1997
  • Computer Science
  • Discret. Comput. Geom.
Exact computer arithmetic has a variety of uses, including the robust implementation of geometric algorithms. This article has three purposes. The first is to offer fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values. The second is to propose a technique for adaptive precision arithmetic that can often speed these algorithms when they are used to perform multiprecision calculations that do not always require exact arithmetic, but… 
Formal certification of arithmetic filters for geometric predicates
TLDR
This paper studies a floating-point implementation of a filter for the orientation-2 predicate, and how a formal and partially automatized verification of this algorithm avoided many pitfalls.
Automatic generation of staged geometric predicates
TLDR
Shewchuk's method to arbitrary polynomial expressions is extended, presented formally through several judgments that govern the compilation of the source expression into target code, which is then easily transformed into SML or, in case of single-stage expressions, into C.
Interval arithmetic yields efficient dynamic filters for computational geometry
TLDR
An efficient floating point filter for the computation of the sign of a determinant that works for arbitrary dimensions is engineer and how to use the interval techniques for exact linear optimization problems of low dimension as they arise in geometric computing is shown.
Formally certified floating-point filters for homogeneous geometric predicates
TLDR
This paper studies a floating-point implementation of a filter for the orientation-2 predicate, and how a formal and partially automatized verification of this algorithm avoided many pitfalls.
Accurate Floating-Point Product and Exponentiation
  • S. Graillat
  • Computer Science
    IEEE Transactions on Computers
  • 2009
TLDR
A method to improve the accuracy of the product of floating-point numbers is focused on and it is shown that the computed result is as accurate as if computed in twice the working precision.
Static analysis yields efficient exact integer arithmetic for computational geometry
TLDR
A program implemented using a naive substitution of floating-point arithmetic for real arithmetic can fail, since geometric primitives depend upon sign-evaluation and may not be reliable if evaluated approximately.
Automatic Generation of Staged Geometric Predicates
TLDR
This work extends Shewchuk's method to arbitrary polynomial expressions, given as programs in a suitable source language featuring basic arithmetic operations of addition, subtraction, multiplication and squaring, which are to be perceived by the programmer as exact.
A New Multiplication Algorithm for Extended Precision Using Floating-Point Expansions
TLDR
A new multiplication algorithm for FP expansion with flexible precision, up to the order of tens of FP elements in mind, that has the regularity of a fixed-point representation while allowing the computation to be naturally carried out using native FP types.
Accelerating the exact evaluation of geometric predicates with GPUs
TLDR
The excellent performance associated to the exactness makes this technique suitable for accelerating geometric operations in fields such as CAD, GIS, VLSI design and meshing.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 36 REFERENCES
Algorithms for arbitrary precision floating point arithmetic
  • Douglas M. Priest
  • Computer Science
    [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic
  • 1991
TLDR
The author presents techniques for performing computations of very high accuracy using only straightforward floating-point arithmetic operations of limited precision, and an algorithm is presented which computes the intersection of a line and a line segment.
Efficient exact arithmetic for computational geometry
TLDR
An experimental expression compiler is described that conveniently packages the effect of exact integer arithmetic at a cost close to that of floating-point arithmetic by combining tuned multiprecision integer arithmetic and a floating- point filter based on interval analysis.
Static analysis yields efficient exact integer arithmetic for computational geometry
TLDR
A program implemented using a naive substitution of floating-point arithmetic for real arithmetic can fail, since geometric primitives depend upon sign-evaluation and may not be reliable if evaluated approximately.
On properties of floating point arithmetics: numerical stability and the cost of accurate computations
TLDR
It is concluded that programmers and theorists alike must be willing to adopt a more sophisticated view of floating point arithmetic, even if only to consider that more accurate and reliable computations than those presently in common use might be possible based on stronger hypotheses than are customarily assumed.
Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic
  • V. Milenkovic
  • Computer Science, Mathematics
    30th Annual Symposium on Foundations of Computer Science
  • 1989
For the first time it is shown how to reduce the cost of performing specific geometric constructions by using rounded arithmetic instead of exact arithmetic. By exploiting a property of
The problems of accuracy and robustness in geometric computation
TLDR
Three perturbation-free methods are considered: floating-point computation, limited-precision rational arithmetic, and purely symbolic representations, namely, representation and model, altering the symbolic data, and avoiding degeneracies.
Efficient Delaunay triangulation using rational arithmetic
TLDR
Adapt-precision algorithms for finding the signs of determinants of matrices with integer and rational elements that can triangulate a set of random rational points in the unit circle only four to five times slower than can a floating-point implementation of the algorithm.
Exact geometric computation in LEDA
TLDR
Almost all geometric algorithms are based on the RealRAM model, but implementors often simply replace the exact real arithmetic of this model by fixed precision arithmetic, thereby making correct algorithms incorrect, and preventing application areas from making use of the rich literature of geometric algorithms developed in computational geometry.
A floating-point technique for extending the available precision
A technique is described for expressing multilength floating-point arithmetic in terms of singlelength floating point arithmetic, i.e. the arithmetic for an available (say: single or double
Analysis of some known methods of improving the accuracy of floating-point sums
TLDR
The computer-oriented parity arithmetic is not commonly known, but it has some desirable properties, as this paper will demonstrate.
...
1
2
3
4
...