Advances in co-volume mesh generation and mesh optimisation techniques

Abstract This paper introduces developments in modified techniques for the generation of unstructured, non-uniform, dual orthogonal meshes which are suitable for use with co-volume solution schemes. Two new mesh generation techniques, a modified advancing front technique and an octree-Delaunay algorithm, are coupled with a mesh optimisation algorithm. When using a Delaunay–Voronoi dual, to construct mutually orthogonal meshes for co-volume schemes, it is essential to minimise the number of Delaunay elements which do not contain their Voronoi vertex. These new techniques provide an improvement over previous approaches, as they produce meshes in which the number of elements that do not contain their Voronoi vertex is reduced. In particular, it is found that the optimisation algorithm, which could be applied to any mesh cosmetics problem, is very effective, regardless of the quality of the initial mesh. This is illustrated by applying the proposed approach to a number of complex industrial aerospace geometries.

[1]  J. Remacle,et al.  Blossom‐Quad: A non‐uniform quadrilateral mesh generator using a minimum‐cost perfect‐matching algorithm , 2012 .

[2]  G. Viswanathan,et al.  Lévy flights and superdiffusion in the context of biological encounters and random searches , 2008 .

[3]  Oubay Hassan,et al.  Strategies for Generating Well Centered Tetrahedral Meshes on Industrial Geometries , 2015 .

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

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

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

[7]  R. Löhner,et al.  Progress in grid generation via the advancing front technique , 2005, Engineering with Computers.

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

[9]  Damrong Guoy,et al.  A dihedral acute triangulation of the cube , 2009, Comput. Geom..

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

[11]  Damrong Guoy,et al.  Well-centered Planar Triangulation - An Iterative Approach , 2008, IMR.

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

[13]  Jun-Hai Yong,et al.  An algorithm for tetrahedral mesh generation based on conforming constrained Delaunay tetrahedralization , 2005, Comput. Graph..

[14]  J. Edmonds Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

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

[16]  Damrong Guoy,et al.  Computational Geometry: Theory and Applications Geometric and Combinatorial Properties of Well-centered Triangulations in Three and Higher Dimensions , 2022 .

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

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

[19]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[20]  Desheng Wang,et al.  Tetrahedral mesh generation and optimization based on centroidal Voronoi tessellations , 2003 .

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