Delaunay triangulations in three dimensions with finite precision arithmetic (Q1195754)

The authors propose a modified version of a known algorithm for Delaunay triangulation of a given set in three-space to insure correct topology in finite precision arithmetic. They prove that their algorithm satisfies a well defined notion of robustness (assuming, as the authors do, that one does not run into trouble computing 5-by-5 determinants; it would be better to check whether a fifth point is or is not in the circumsphere of a tetrahedron without using determinants).