This paper on "Computation of a Boundary Conforming Triangulation" was presented at the NAFEMS World Congress on Design, Simulation & Optimisation: Reliability & Applicability of Computational Methods - 9-11 April 1997, Stuttgart, Germany.

Summary

The problem considered is to generate a boundary conforming triangulation (a tetrahedral mesh) from a set of points, all of which lie on the surface of an object. In the particular application of interest, the boundary conforming triangulation is required to respect the Delaunay criterion, where the circumsphere of each tetrahedron contains no other point. Algorithms will be described which extend the Domain Delaunay triangulation algorithm of Sapidis [8], providing a better technique for choosing surface facets and a new technique for recovering a boundary faceting when the surface point distribution is not sufficiently dense.