- Published 2002 in Symposium on Computational Geometry

Given a surface mesh <i>F</i> in <i>R</i> <sup>3</sup> with vertex set <i>S</i> and consisting of Delaunay triangles, we want to construct the Delaunay tetrahedralization of <i>S</i>.We present an algorithm which constructs the Delaunay tetrahedralization of <i>S</i> given a bounded degree spanning subgraph <i>T</i> of <i>F</i>. It accelerates the incremental Delaunay triangulation construction by exploiting the connectivity of the points on the surface. If the expected size of the Delaunay triangulation is linear, we prove that our algorithm runs in <i>O</i>(<i>n</i> log<sup>*</sup> <i>n</i>) expected time, speeding up the standard randomized incremental Delaunay triangulation algorithm, which is <i>O</i>(<i>n</i> log <i>n</i>) expected time in this case.We discuss how to find a bounded degree spanning subgraph <i>T</i> from surface mesh <i>F</i> and give a linear time algorithm which obtains a spanning subgraph from any triangulated surface with genus <i>g</i> with maximum degree at most 12<i>g</i> for <i>g</i>>0 or three for <i>g</i>=0.

@inproceedings{Choi2002TheDT,
title={The Delaunay tetrahedralization from Delaunay triangulated surfaces Sunghee Choi},
author={Sunghee Choi},
booktitle={Symposium on Computational Geometry},
year={2002}
}