Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries

This paper outlines some recent developments in the process of generating well centered tetrahedral meshes. A well centered tetrahedron contains its circumcentre, which is a basic property required for a valid co-volume discretisation. Although most work in this area has focussed on improving meshes generated using classical techniques, in this paper we consider modification of the generation procedure itself. A simple lattice point insertion technique is introduced and the potential of the technique for generating well centered meshes is demonstrated. This is accomplished by comparing, for some complex geometries, the meshes generated with the meshes created by a standard Delaunay mesh refinement technique. Despite the simplicity of the lattice point insertion method, the comparison is found to be favourable and the method is shown to produce good well centered elements in the vicinity of the geometry.

[1]  Kenneth Morgan,et al.  Tailoring unstructured meshes for use with a 3D time domain co‐volume algorithm for computational electromagnetics , 2011 .

[2]  Kenneth Morgan,et al.  Modified cuckoo search: A new gradient free optimisation algorithm , 2011 .

[3]  Rao V. Garimella,et al.  Proceedings of the 17th International Meshing Roundtable , 2008 .

[4]  M. Ortiz,et al.  Tetrahedral mesh generation based on node insertion in crystal lattice arrangements and advancing-front-Delaunay triangulation , 2000 .

[5]  V. T. Rajan.  Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

[6]  Dong-Ming Yan,et al.  Efficient computation of clipped Voronoi diagram for mesh generation , 2013, Comput. Aided Des..

[7]  Régis Duvigneau,et al.  Low cost PSO using metamodels and inexact pre-evaluation: Application to aerodynamic shape design , 2009 .

[8]  Damrong Guoy,et al.  Triangulation of Simple 3D Shapes with Well-Centered Tetrahedra , 2008, IMR.

[9]  Nigel P. Weatherill,et al.  Smooth Delaunay-Voronoï Dual Meshes for Co-Volume Integration Schemes , 2006, IMR.

[10]  Oubay Hassan,et al.  Reduced order mesh optimisation using proper orthogonal decomposition and a modified cuckoo search , 2013 .

[11]  O. C. Zienkiewicz,et al.  Adaptive remeshing for compressible flow computations , 1987 .

[12]  F. Harlow,et al.  Numerical Calculation of Time‐Dependent Viscous Incompressible Flow of Fluid with Free Surface , 1965 .

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

[14]  S. Walton.  Gradient free optimisation in selected engineering applications , 2013 .

[15]  K. Yee.  Numerical solution of initial boundary value problems involving maxwell's equations in isotropic media , 1966 .

[16]  A. Egemen Yilmaz,et al.  A particle swarm optimization approach for hexahedral mesh smoothing , 2009 .

[17]  D. Naylor.  Filling space with tetrahedra , 1999 .

[18]  Nigel P. Weatherill,et al.  Generating the Voronoi-Delaunay Dual Diagram for Co-Volume Integration Schemes , 2007, 4th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD 2007).

[19]  J. Peraire,et al.  Unstructured grid methods for compressible flows , 1992 .

[20]  Suzanne M. Shontz,et al.  Two derivative-free optimization algorithms for mesh quality improvement , 2010, ICCS.

[21]  Damrong Guoy,et al.  Well-Centered Triangulation , 2008, SIAM J. Sci. Comput..

[22]  Nigel P. Weatherill,et al.  A stitching method for the generation of unstructured meshes for use with co-volume solution techniques , 2006 .

[23]  Matthew B. Kennel.  KDTREE 2: Fortran 95 and C++ software to efficiently search for near neighbors in a multi-dimensional Euclidean space , 2004 .

[24]  David Eppstein,et al.  Tiling space and slabs with acute tetrahedra , 2003, Comput. Geom..

[25]  Chenglei Yang,et al.  On centroidal voronoi tessellation—energy smoothness and fast computation , 2009, TOGS.