A mesh generator for tetrahedral elements using Delaunay triangulation

A tetrahedral mesh generator is developed. The generator is based on the Delaunay triangulation which is implemented by using the insertion polyhedron algorithm. Some new methods for dealing with the problems associated with the three-dimensional Delaunay triangulation and the insertion polyhedron algorithm are presented: degeneracy, the crossing situation, identification of the internal elements, and internal point generation. The generator works for both convex and nonconvex domains, including those with high aspect-ratio subdomains. Some examples (electromagnetic design and semiconductor device design) illustrate the capability of the generator