Two design principles of geometric algorithms in finite-precision arithmetic
From MaRDI portal
Publication:749243
DOI10.1016/0893-9659(89)90022-0zbMATH Open0712.68103OpenAlexW2032860274MaRDI QIDQ749243FDOQ749243
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
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
- A new polynomial-time algorithm for linear programming
- Polynomial algorithms in linear programming
- IMPROVEMENTS OF THE INCREMENTAL METHOD FOR THE VORONOI DIAGRAM WITH COMPUTATIONAL COMPARISON OF VARIOUS ALGORITHMS
- Two algorithms for constructing a Delaunay triangulation
- A multiplicative barrier function method for linear programming
- Title not available (Why is that?)
Cited In (13)
- Delaunay triangulation of imprecise points in linear time after preprocessing
- Title not available (Why is that?)
- Robust gift wrapping for the three-dimensional convex hull
- A fast and robust RNS algorithm for evaluating signs of determinants
- A perturbation scheme for spherical arrangements with application to molecular modeling
- Recent progress in exact geometric computation
- Realistic input models for geometric algorithms
- Towards exact geometric computation
- The Design of Core 2: A Library for Exact Numeric Computation in Geometry and Algebra
- An exact general remeshing scheme applied to physically conservative voxelization
- Towards a topology for computational geometry
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- Evaluating signs of determinants using single-precision arithmetic
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)