The Cutting Pattern Problem for Tetrahedral Mesh Generation

In this work we study the following cutting pattern problem. Given a triangulated surface (i.e. a two-dimensional simplicial complex), assign each triangle with a triple of ±1, one integer per edge, such that the assignment is both complete (i.e. every triangle has integers of both signs) and consistent (i.e. every edge shared by two triangles has opposite signs in these triangles). We show that this problem is the major challenge in converting a volumetric mesh consisting of prisms into a mesh consisting of tetrahedra, where each prism is cut into three tetrahedra. In this paper we provide a complete solution to this problem for topological disks under various boundary conditions ranging from very restricted one to the most flexible one. For each type of boundary conditions, we provide efficient algorithms to compute valid assignments if there is any, or report the obstructions otherwise. For all the proposed algorithms, the convergence is validated and the complexity is analyzed.

[1]  Rainald Loehner,et al.  Matching semi-structured and unstructured grids for Navier-Stokes calculations , 1993 .

[2]  Roger Crawfis,et al.  Efficient subdivision of finite-element datasets into consistent tetrahedra , 1997, Proceedings. Visualization '97 (Cat. No. 97CB36155).

[3]  Peter Hansbo,et al.  On advancing front mesh generation in three dimensions , 1995 .

[4]  Marie-Gabrielle Vallet,et al.  How to Subdivide Pyramids, Prisms, and Hexahedra into Tetrahedra , 1999, IMR.

[5]  Mark S. Shephard,et al.  Automatic three-dimensional mesh generation by the finite octree technique , 1984 .

[6]  T. Dey.  Delaunay Mesh Generation of Three Dimensional Domains ∗ , 2007 .

[7]  Shahyar Pirzadeh.  Advancing-layers method for generation of unstructured viscous grids , 1993 .

[8]  Nelson L. Max,et al.  Flow volumes for interactive vector field visualization , 1993, Proceedings Visualization '93.

[9]  André Garon,et al.  Interpolation-free space-time remeshing for the Burgers equation , 1997 .

[10]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[11]  Paresh Parikh,et al.  Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .

[12]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[13]  Mark S. Shephard,et al.  Automatic three‐dimensional mesh generation by the finite octree technique , 1984 .

[14]  Joseph A. Gallian,et al.  A Dynamic Survey of Graph Labeling , 2009, The Electronic Journal of Combinatorics.

[15]  Herbert Edelsbrunner,et al.  Geometry and Topology for Mesh Generation , 2001, Cambridge monographs on applied and computational mathematics.

[16]  Shahyar Pirzadeh,et al.  Unstructured Viscous Grid Generation by Advancing-Layers Method , 1993 .