Automatic Mesh Generation for Complex Three-Dimensional Regions Using a Constrained Delaunay Triangulation

Engineering with Computers, Springer-Verlag, Num 5, pp.161-175, 1989

MESHING
RESEARCH
CORNER

Department of Mechanical and Aerospace Engineering, Princeton University, Princeton, NJ, USA

Abstract
This paper describes a method for generating tetrahedral meshes. The algorithm, based on the Delaunay triangulation. can treat objects of essentially arbitrary complexity. In order to preserve the surface triangulation of solid objects. it is necessary to override the Delaunay property and redefine the triangulation when points are introduced that are close to solid boundaries. Details of this constrained Delaunay algorithm are presented and an efficient implementation of the triangulation method is described. Techniques for controlling the distribution of mesh points and tetrahedron quality are also discussed.