The definition of a Delaunay tetrahedralization (DT) of a set S of points is well known: a DT is a tetrahedralization of S in which every simplex (tetrahedron, triangle, or edge) is Delaunay. A simplex is Delaunay if all of its vertices can be connected by a circumsphere that encloses no other vertex. An important remark made in virtually all papers on this topic is that “although any number of...