Evaluating signs of determinants using single-precision arithmetic

DOI10.1007/BF02522822MaRDI QIDQ675307zbMATH OpenOpenAlexFDO

Authors Francis Avnaim, Jean-Daniel Boissonnat, Olivier Devillers, F. P. Preparata, Mariette Yvinec

Publication date 30 June 1997

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02522822

zbMATH Keywords

robustnessgeometric computation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1256676
• Efficient exact evaluation of signs of determinants
• A HYBRID APPROACH FOR DETERMINANT SIGNS OF MODERATE-SIZED MATRICES

Cites work

• scientific article; zbMATH DE number 1256676 (Why is no real title available?)
• Two design principles of geometric algorithms in finite-precision arithmetic
• Verifiable implementations of geometric algorithms using finite precision arithmetic

Cited in

(9)

• THE L_∞ VORONOI DIAGRAM OF SEGMENTS AND VLSI APPLICATIONS
• Certification of numerical computation of the sign of the determinant of a matrix
• A fast and robust RNS algorithm for evaluating signs of determinants
• A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING
• Algebraic and numerical techniques for the computation of matrix determinants
• A robust algorithm for geometric predicate by error-free determinant transformation
• Computations that require higher than double precision for robust and exact decision making
• Interval arithmetic yields efficient dynamic filters for computational geometry
• Computing the sign or the value of the determinant of an integer matrix, a complexity survey.

Describes a project that uses

Uses Software

• LEDA
• Hull

This page was built for publication: Evaluating signs of determinants using single-precision arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675307)