Boundary Recovery Algorithm of 3D Constrained Delaunay Triangulation

摘要

The paper introduces the process of an algorithm of 3D constrained Delaunay tetrahedralization(CDT), and propose an efficient boundary recovery algorithm. On the basis of the generation of the initial tetrahedralization, it only requires a few additional points to be inserted to achieve the edge recovery, and implement face recovery after the local degeneracy is removed. The algorithms are proved to be efficient, robust and easy to be implemented in practical applications.