Two design principles of geometric algorithms in finite-precision arithmetic

DOI10.1016/0893-9659(89)90022-0MaRDI QIDQ749243zbMATH OpenOpenAlexFDO

Authors Masao Iri, K. 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

finite precisioncomputer programsGeometric algorithms

Mathematics Subject Classification ID

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

Recommendations

• Verifiable implementations of geometric algorithms using finite precision arithmetic
• scientific article; zbMATH DE number 1008329
• Towards exact geometric computation
• On finite-precision representations of geometric objects
• Geometric algorithms for discreteness and faithfulness
• scientific article; zbMATH DE number 4080990
• scientific article; zbMATH DE number 3933909
• Degree-driven design for correct geometric algorithms
• Geometric foundations of numerical algorithms and symmetry
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra

Cites work

• scientific article; zbMATH DE number 3877318 (Why is no real title available?)
• A multiplicative barrier function method for linear programming
• A new polynomial-time algorithm for linear programming
• IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
• Polynomial algorithms in linear programming
• Two algorithms for constructing a Delaunay triangulation

Cited in

(15)

• Degree-driven design for correct geometric algorithms
• Delaunay triangulation of imprecise points in linear time after preprocessing
• Towards a topology for computational geometry
• Evaluating signs of determinants using single-precision arithmetic
• An exact general remeshing scheme applied to physically conservative voxelization
• scientific article; zbMATH DE number 1629973 (Why is no real title available?)
• A fast and robust RNS algorithm for evaluating signs of determinants
• Computing planar Voronoi diagrams in double precision, a further example of degree-driven algorithm design
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Towards exact geometric computation
• Realistic input models for geometric algorithms
• A perturbation scheme for spherical arrangements with application to molecular modeling
• Recent progress in exact geometric computation
• Robust gift wrapping for the three-dimensional convex hull
• The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra

This page was built for publication: Two design principles of geometric algorithms in finite-precision arithmetic

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