Robustness and Precision Issues in Geometric Computation**Work on this survey was partially supported by the ESPRIT IV Long Term Research Project No. 21957 (CGAL).
- 1 January 2000
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 42 references indexed in Scilit:
- Evaluating signs of determinants using single-precision arithmeticAlgorithmica, 1997
- The quickhull algorithm for convex hullsACM Transactions on Mathematical Software, 1996
- A General Approach to Removing DegeneraciesSIAM Journal on Computing, 1995
- Delaunay triangulations in three dimensions with finite precision arithmeticComputer Aided Geometric Design, 1992
- Convex Decomposition of Polyhedra and RobustnessSIAM Journal on Computing, 1992
- Generalised characteristic polynomialsJournal of Symbolic Computation, 1990
- Applied computational geometry: Towards robust solutions of basic problemsJournal of Computer and System Sciences, 1990
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- A floating-point technique for extending the available precisionNumerische Mathematik, 1971