A robust algorithm for geometric predicate by error-free determinant transformation

@article{Ozaki2012ARA,
  title={A robust algorithm for geometric predicate by error-free determinant transformation},
  author={Katsuhisa Ozaki and Takeshi Ogita and Shin'ichi Oishi},
  journal={Inf. Comput.},
  year={2012},
  volume={216},
  pages={3-13}
}

Tables from this paper

Computing the exact sign of sums of products with floating point arithmetic
TLDR
The algorithm is efficient and uses only of floating point arithmetic, which is much faster than exact arithmetic, and it is proved that the algorithm is correct and the efficient and tested C++ code for it is correct.
Improving the GJK algorithm for faster and more reliable distance queries between convex objects
TLDR
A new version of the Gilbert-Johnson-Keerthi (GJK) algorithm is presented that circumvents the shortcomings introduced by degenerate geometries and is guided toward a shorter search path in less computing time by a distance subalgorithm that is faster and accurate to machine precision.
Improving the GJK Algorithm for Faster and More Reliable Distance Queries Between Convex Objects
TLDR
A new version of the Gilbert-Johnson-Keerthi (GJK) algorithm is presented that circumvents the shortcomings introduced by degenerate geometries and is guided toward a shorter search path in less computing time by a distance subalgorithm that is faster and accurate to machine precision.
Floating-point filters towards floating-point exceptions
TLDR
This talk simplifies the floating-point filters for the two dimensional orientation problem and ensures correctness of a numerical result when a problem is well-conditioned even if floating- point exceptions like overflow and underflow occur in floating-points evaluation.
Extension of floating-point filters to absolute and relative errors for numerical computation
TLDR
This paper extends floating-point filters to guarantee absolute and relative errors in order to verify the accuracy of approximate solutions in the computational geometry field.

References

SHOWING 1-10 OF 23 REFERENCES
Adaptive and efficient algorithm for 2D orientation problem
TLDR
A robust geometric predicate for the 2D orientation problem that works fairly faster than the state-of-the-art algorithm in various cases and provably outputs a result faithfully rounded from the exact value of the summation of floating-point numbers.
Classroom examples of robustness problems in geometric computations
TLDR
This extended abstract studies a simple incremental algorithm for planar convex hulls and gives examples which make the algorithm fail in all pos- sible ways, and discusses the geometry of the floating point implementation of the orientation predicate.
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 Summation Part I: Faithful Rounding
TLDR
This paper presents an algorithm for calculating a faithful rounding of a vector of floating-point numbers, which adapts to the condition number of the sum, and proves certain constants used in the algorithm to be optimal.
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
TLDR
This article offers fast software-level algorithms for exact addition and multiplication of arbitrary precision floating-point values and proposes 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 must satisfy some error bound.
Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
TLDR
An algorithm for calculating the rounded-to-nearest result of $s:=\sum p_i$ for a given vector of floating-point numbers $p_i$, as well as algorithms for directed rounding, working for huge dimensions.
Delaunay refinement algorithms for triangular mesh generation
Efficient Exact Evaluation of Signs of Determinants
TLDR
Two different methods to evaluate the sign of a determinant with integer entries, based on the Gram—Schmidt orthogonalization process and an extension to n × n determinants of the ABDPY method, which works only for 2 × 2 and 3 × 3 determinants are presented.
Certification of Numerical Computation of the Sign of the Determinant of a Matrix
TLDR
New effective arithmetic filters are devised for the certification of the sign of the determinant of a matrix by Gaussian elimination with pivoting and of estimating the minimum distance from A to a singular matrix.
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.
...
...