Three-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach.
Paulo Roma Cavalcanti, Ulisses T. Mello · 1999
In this paper we summarize our experiences with3Dconstrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementation process for constructing3Dconstrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved by inserting Steiner points on missing constraining edges and faces in the initial unconstrained triangulations. This approach allowed the generation of tetrahedral meshes for arbitrarily complex3Ddomains.