Two design principles of geometric algorithms in finite-precision arithmetic

DOI10.1016/0893-9659(89)90022-0zbMath0712.68103OpenAlexW2032860274MaRDI QIDQ749243

Masao Iri, Kōkichi Sugihara

Publication date: 1989

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(89)90022-0

zbMATH Keywords

computer programsfinite precisionGeometric algorithms

Mathematics Subject Classification ID

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

Related Items

Robust gift wrapping for the three-dimensional convex hull ⋮ An exact general remeshing scheme applied to physically conservative voxelization ⋮ Evaluating signs of determinants using single-precision arithmetic ⋮ Towards exact geometric computation ⋮ Recent progress in exact geometric computation ⋮ A perturbation scheme for spherical arrangements with application to molecular modeling ⋮ Delaunay triangulation of imprecise points in linear time after preprocessing ⋮ A fast and robust RNS algorithm for evaluating signs of determinants

Cites Work

• Unnamed Item
• A new polynomial-time algorithm for linear programming
• A multiplicative barrier function method for linear programming
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Two algorithms for constructing a Delaunay triangulation
• Polynomial algorithms in linear programming