Efficient exact evaluation of signs of determinants
From MaRDI portal
Publication:1977117
DOI10.1007/s004530010003zbMath0947.65053OpenAlexW2013279615MaRDI QIDQ1977117
Mariette Yvinec, Hervé Brönnimann
Publication date: 22 June 2000
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00073549/file/RR-3140.pdf
Gram-Schmidt orthogonalizationcomputer graphicsgeometric algorithmscomputational geometrylattice methodsigns of determinantsnonnumerical algorithmsreorthogonalization method
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical computation of determinants (65F40)
Related Items
Faster geometric algorithms via dynamic determinant computation, The shifted number system for fast linear algebra on integer matrices, A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs, Computing the sign or the value of the determinant of an integer matrix, a complexity survey., VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments, A robust algorithm for geometric predicate by error-free determinant transformation, A perturbation scheme for spherical arrangements with application to molecular modeling, Sign determination in residue number systems
Uses Software
