Improved boundary constrained tetrahedral mesh generation by shell transformation

Summary An excessive number of Steiner points may be inserted during the process of boundary recovery for constrained tetrahedral mesh generation, and these Steiner points are harmful in some circumstances. In this study, a new flip named shell transformation is proposed to reduce the usage of Steiner points in boundary recovery and thus to improve the performance of boundary recovery in terms of robustness, efficiency and element quality. Shell transformation searches for a local optimal mesh among multiple choices. Meanwhile, its recursive callings can perform flips on a much larger element set than a single flip, thereby leading the way to a better local optimum solution. By employing shell transformation properly, a mesh that intersects predefined constraints intensively can be transformed to another one with much fewer intersections, thus remarkably reducing the occasions of Steiner point insertion. Besides, shell transformation can be used to remove existing Steiner points by flipping the mesh aggressively. Meshing examples for various industrial applications and surface inputs mainly composed of stretched triangles are presented to illustrate how the improved algorithm works on difficult boundary constrained meshing tasks.

[1]  B. G. Larwood,et al.  Domain decomposition approach for parallel unstructured mesh generation , 2003 .

[2]  Jianfei Liu,et al.  Small polyhedron reconnection for mesh improvement and its implementation based on advancing front technique , 2009 .

[3]  E. J. Probert,et al.  Unstructured mesh procedures for the simulation of three‐dimensional transient compressible inviscid flows with moving boundary components , 1998 .

[4]  Raimund Seidel,et al.  On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..

[5]  Stephan M. Hitzel,et al.  Parallel remeshing of unstructured volume grids for CFD applications , 2007 .

[6]  R. Lewis,et al.  Three-dimensional unstructured mesh generation: Part 3. Volume meshes , 1996 .

[7]  P. George,et al.  ‘Ultimate’ robustness in meshing an arbitrary polyhedron , 2003 .

[8]  P. George.  Improvements on Delaunay-based three-dimensional automatic mesh generator , 1997 .

[9]  J. Peraire,et al.  UNSTRUCTURED TETRAHEDRAL MESH GENERATION FOR THREE-DIMENSIONAL VISCOUS FLOWS , 1996 .

[10]  Jonathan Richard Shewchuk,et al.  Constrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery , 2002, IMR.

[11]  Dawei Zhao,et al.  Improvements in the reliability and element quality of parallel tetrahedral mesh generation , 2012 .

[12]  Barry Joe,et al.  Three-Dimensional Boundary-Constrained Triangulations , 1992 .

[13]  Nigel P. Weatherill,et al.  Distributed parallel Delaunay mesh generation , 1999 .

[14]  Q. Du,et al.  Boundary recovery for three dimensional conforming Delaunay triangulation , 2004 .

[15]  Paul-Louis George,et al.  Back to Edge Flips in 3 Dimensions , 2003, IMR.

[16]  Evangelos K. Koutsavdis,et al.  Transonic Store Separation Using Unstructured CFD With Dynamic Meshing , 2003 .

[17]  Jonathan Richard Shewchuk,et al.  Robust adaptive floating-point geometric predicates , 1996, SCG '96.

[18]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[19]  Yuanxian Gu,et al.  The boundary recovery and sliver elimination algorithms of three‐dimensional constrained Delaunay triangulation , 2006 .

[20]  Barry Joe,et al.  Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations , 1995, SIAM J. Sci. Comput..

[21]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[22]  Anwei Liu,et al.  How far flipping can go towards 3D conforming/constrained triangulation , 2000, IMR.

[23]  Nadja Goerigk.  International Meshing Roundtable ( IMR 24 ) On Indecomposable Polyhedra and The Number of Steiner Points , 2015 .

[24]  P. George,et al.  Automatic mesh generator with specified boundary , 1991 .

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

[26]  J. Peraire,et al.  Mesh generation and adaptivity for the solution of compressible viscous high speed flows , 1995 .

[27]  E. Schönhardt,et al.  Über die Zerlegung von Dreieckspolyedern in Tetraeder , 1928 .

[28]  Yufeng Yao,et al.  An improved local remeshing algorithm for moving boundary problems , 2016 .

[29]  J. Shewchuk.  Two Discrete Optimization Algorithms for the Topological Improvement of Tetrahedral Meshes , 2002 .

[30]  Qiang Du,et al.  Constrained boundary recovery for three dimensional Delaunay triangulations , 2004 .

[31]  Jianjun Chen,et al.  Three-dimensional constrained boundary recovery with an enhanced Steiner point suppression procedure , 2011 .

[32]  Paul-Louis George,et al.  Optimization of Tetrahedral Meshes , 1995 .

[33]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[34]  Alan M. Shih,et al.  Efficient Hybrid Surface/Volume Mesh Generation Using Suppressed Marching-Direction Method , 2013 .

[35]  Rafael Montenegro,et al.  Smoothing and local refinement techniques for improving tetrahedral mesh quality , 2005 .

[36]  K. Gärtner,et al.  3D boundary recovery by constrained Delaunay tetrahedralization , 2011 .

[37]  Yan Liu,et al.  Boundary recovery for 3D Delaunay triangulation , 2014 .

[38]  Bin Chen,et al.  Boundary recovery after 3D Delaunay tetrahedralization without adding extra nodes , 2007 .

[39]  Hang Si,et al.  TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator , 2015, ACM Trans. Math. Softw..

[40]  Carl Ollivier-Gooch,et al.  Tetrahedral mesh improvement using swapping and smoothing , 1997 .

[41]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[42]  Jianjun Chen,et al.  Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation , 2006 .