A robust algorithm for geometric predicate by error-free determinant transformation
From MaRDI portal
Publication:714616
DOI10.1016/j.ic.2011.09.007zbMath1257.65010OpenAlexW1973429336MaRDI QIDQ714616
Katsuhisa Ozaki, Takeshi Ogita, Shin'ichi Oishi
Publication date: 11 October 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.09.007
algorithmnumerical experimentscomputational geometryerror-free determinant transformationverified numerical computation
Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Algorithms with automatic result verification (65G20)
Uses Software
Cites Work
- Unnamed Item
- Evaluating signs of determinants using single-precision arithmetic
- Adaptive and efficient algorithm for 2D orientation problem
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Delaunay refinement algorithms for triangular mesh generation
- Recent progress in exact geometric computation
- Efficient exact evaluation of signs of determinants
- Classroom examples of robustness problems in geometric computations
- Accurate Floating-Point Summation Part II: Sign, K-Fold Faithful and Rounding to Nearest
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- The computational geometry algorithms library CGAL
- Formally certified floating-point filters for homogeneous geometric predicates
- Accurate Sum and Dot Product
- Interval arithmetic yields efficient dynamic filters for computational geometry
- Certification of numerical computation of the sign of the determinant of a matrix
This page was built for publication: A robust algorithm for geometric predicate by error-free determinant transformation
