Hybrid meshing using constrained Delaunay triangulation for viscous flow simulations

In this paper, we present a generalized prismatic hybrid meshing method for viscous flow simulations. One major difficulty in implementing a robust prismatic hybrid meshing tool is to handle boundary layer mesh collisions and normally an extra data structure (e.g. quadtree in 2D and octree in 3D) is required. The proposed method overcomes this difficulty via an heuristic approach and it only relies on Constrained Delaunay Triangulation/Tetrahedralization(CDT). No extra data structures are required. Geometrical reasoning is used to approximate the maximum marching distance of each point by walking through the CDT. This is combined with post-processing of marching vectors and distance and prohibition of multilevel differences to form an automatic and robust mechanism to remove boundary layer mesh collisions. Benefiting from the matureness of CDT techniques, the proposed method is robust, efficient and simple to implement. Its capability is demonstrated by generating quality prismatic hybrid meshes for industrial models with complex geometries. The proposed method is believed to be able considerably reduce the effort to implement a robust hybrid prismatic mesh generator for viscous flow simulations. Copyright c © 0000 John Wiley & Sons, Ltd.

[1]  Jonathan Richard Shewchuk,et al.  Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations , 2000, SCG '00.

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

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

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

[5]  Marc Vigo Anglada,et al.  An improved incremental algorithm for constructing restricted delaunay triangulations , 1997, Comput. Graph..

[6]  K. Nakahashi,et al.  Hybrid Prismatic/Tetrahedral Grid Generation for Viscous Flow Applications , 1998 .

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

[8]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[9]  L. Paul Chew,et al.  Constrained Delaunay triangulations , 1987, SCG '87.

[10]  Mark S. Shephard,et al.  Boundary layer mesh generation for viscous flow simulations , 2000 .

[11]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

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

[13]  N. Weatherill,et al.  Unstructured grid generation using iterative point insertion and local reconnection , 1995 .

[14]  David L. Marcum,et al.  Generation of unstructured grids for viscous flow applications , 1995 .

[15]  Rainald Löhner,et al.  Generation of non‐isotropic unstructured grids via directional enrichment , 2000 .

[16]  S. Connell,et al.  Semistructured mesh generation for three-dimensional Navier-Stokes calculations , 1995 .

[17]  Yannis Kallinderis,et al.  Hybrid grid generation for turbomachinery and aerospace applications , 2000 .

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

[19]  H. Si.  Constrained Delaunay tetrahedral mesh generation and refinement , 2010 .

[20]  L. di Mare,et al.  Lip Stall Suppression in Powered Intakes , 2016 .

[21]  Marshal L. Merriam,et al.  An efficient advancing front algorithm for Delaunay triangulation , 1991 .

[22]  H. Si.  Three Dimensional Boundary Conforming Delaunay Mesh Generation , 2008 .

[23]  Y. Kallinderis,et al.  Prismatic Grid Generation for Three-Dimensional Complex Geometries , 1993 .

[24]  R. Löhner,et al.  Generation of viscous grids at ridges and corners , 2009 .

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

[26]  Jonathan Richard Shewchuk,et al.  Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates , 1997, Discret. Comput. Geom..

[27]  Kazuhiro Nakahashi,et al.  Multiple Marching Direction Approach to Generate High-Quality Hybrid Meshes , 2007 .

[28]  Robin Sibson,et al.  Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[29]  Kazuhiro Nakahashi,et al.  Improvements in the reliability and quality of unstructured hybrid mesh generation , 2004 .

[30]  David L. Marcum,et al.  Efficient Generation of High-Quality Unstructured Surface and Volume Grids , 2001, Engineering with Computers.

[31]  Ernst P. Mücke,et al.  Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations , 1996, SCG '96.

[32]  Feng Wang,et al.  Whole aero-engine meshing and CFD simulation , 2013 .

[33]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[34]  Asymptotic Velocity Defect Profile in an Incipient-Separating Axisymmetric Flow , 1995 .

[35]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[36]  Patrick M. Knupp,et al.  The Mesquite Mesh Quality Improvement Toolkit , 2003, IMR.

[37]  Yannis Kallinderis,et al.  Hybrid Prismatic/Tetrahedral Grid Generation for Viscous Flows Around Complex Geometries , 1996 .

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