Delaunay triangulations in three dimensions with finite precision arithmetic
- 31 December 1992
- journal article
- Published by Elsevier BV in Computer Aided Geometric Design
- Vol. 9 (6), 457-470
- https://doi.org/10.1016/0167-8396(92)90044-p
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- ON GOOD TRIANGULATIONS IN THREE DIMENSIONSInternational Journal of Computational Geometry & Applications, 1992
- Numerical stability of algorithms for 2D Delaunay triangulationsPublished by Association for Computing Machinery (ACM) ,1992
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithmsACM Transactions on Graphics, 1990
- A geometric consistency theorem for a symbolic perturbation schemePublished by Association for Computing Machinery (ACM) ,1988
- Recipes for geometry and numerical analysis - Part I: an empirical studyPublished by Association for Computing Machinery (ACM) ,1988
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- Consistent calculations for solids modelingPublished by Association for Computing Machinery (ACM) ,1985
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932