Constrained Triangulation: Application To Hex-Dominant Mesh Generation

Boundary-constrained triangulation has long been the domain of Delaunay mesh generation. Another application for constrained triangulation is introduced in this work. A new technique for hexahedral-dominant mesh generation is developed. With this method, known as Hex-Morphing (H-Morph), an initial tetrahedral mesh is provided. The quadrilateral faces of the hexahedra are treated as internal surfaces, which must be recovered. Local transformations are performed on the simplices so that the six quadrilateral faces of a hexahedron have been recovered from the mesh. All tetrahedra internal to the six faces can subsequently be eliminated and a hexahedra formed in their place. Examples and performance of the H-Morph algorithm are presented. Keywords: constrained triangulation, hex-dominant mesh generation, hexahedra, H-Morph, tetrahedral transformations 1. INTRODUCTION Given an initial set of simplices in R 3 comprised of nodes, edges and faces, it may be necessary to modify the arrangem..