Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain

This paper describes an algorithm for the generation of tetrahedral mesh of specified element size over an unbounded three-dimensional domain. Starting from an arbitrary point in space (defined as the origin) and guided by the concept of advancing front, spheres of size compatible with the specified element size are packed tightly together one by one to form a cluster of spheres of different sizes. The compactness of the cluster of spheres is achieved by packing spheres at a site closest to the origin in a densest manner with tangent but no overlapping with as many other spheres as possible. In view of these criteria, a rotational mechanism between spheres is innovated, which allows the newly inserted sphere to follow the path by rotation between existing spheres until the lowest point is reached. The centres of the packing spheres provide ideal locations for Delaunay point insertion to form a triangulation of tetrahedral elements of size compatible with the specified value. Spheres of random size distribution or of size specified by a node spacing function are packed by the proposed algorithm. In all test examples, high-quality tetrahedral elements of size consistent with the specified node spacing are generated. The process is fast and robust, and the time complexity for mesh generation is expected to be almost linear; however, in the present implementation, a quasi-linear time relationship is observed as a search for the nearest node on the front is proposed in the sphere packing process. The memory requirement has been kept to a minimum as no additional data structure other than the adjacency relationship of the tetrahedral elements as required by the Delaunay triangulation is stored. The structure of the advancing frontal surface needs not be explicitly constructed nor updated as it is simply not required in the sphere packing process.

[1]  A. Rassineux,et al.  GENERATION AND OPTIMIZATION OF TETRAHEDRAL MESHES BY ADVANCING FRONT TECHNIQUE , 1998 .

[2]  S. Teng,et al.  Biting: advancing front meets sphere packing , 2000 .

[3]  H. Borouchaki,et al.  Fast Delaunay triangulation in three dimensions , 1995 .

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

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

[6]  E. Koch,et al.  Hexagonal and trigonal sphere packings. II. Bivariant lattice complexes. , 2004, Acta crystallographica. Section A, Foundations of crystallography.

[7]  Rainald Löhner,et al.  Extensions and improvements of the advancing front grid generation technique , 1996 .

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

[9]  Monte Carlo study of the sphere packing problem , 2003 .

[10]  S. Lo.  A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .

[11]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[12]  Diamantis P. Koreas.  The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 , 1997 .

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

[14]  David Eppstein,et al.  Quadrilateral Meshing by Circle Packing , 1999, Int. J. Comput. Geom. Appl..

[15]  S. H. Lo,et al.  OPTIMIZATION OF TETRAHEDRAL MESHES BASED ON ELEMENT SHAPE MEASURES , 1997 .

[16]  Paul-Louis George,et al.  ASPECTS OF 2-D DELAUNAY MESH GENERATION , 1997 .

[17]  S. Lo,et al.  Generation of finite element mesh with variable size over an unbounded 2D domain , 2005 .

[18]  Byung Chai Lee,et al.  Adaptive mesh generation by bubble packing method , 2003 .

[19]  S. Owen,et al.  H-Morph: an indirect approach to advancing front hex meshing , 1999 .

[20]  Marshall W. Bern,et al.  Linear-size nonobtuse triangulation of polygons , 1995, Discret. Comput. Geom..

[21]  O. Zienkiewicz,et al.  A new approach to the development of automatic quadrilateral mesh generation , 1991 .

[22]  David Eppstein,et al.  Faster Circle Packing with Application to Non-Obtuse Triangulation , 1997, Int. J. Comput. Geom. Appl..

[23]  Z. J. Cendes,et al.  Magnetic field computation using Delaunay triangulation and complementary finite element methods , 1983 .

[24]  S. H. Lo,et al.  Finite element mesh generation over analytical curved surfaces , 1996 .

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

[26]  Aleksandar Donev,et al.  A linear programming algorithm to test for jamming in hard-sphere packings , 2002 .

[27]  Yang Dai,et al.  Global Optimization Approach to Unequal Global Optimization Approach to Unequal Sphere Packing Problems in 3D , 2002 .

[28]  C. Lee,et al.  A new scheme for the generation of a graded quadrilateral mesh , 1994 .

[29]  David R. Owen,et al.  Filling domains with disks: an advancing front approach , 2003 .

[30]  Charles Radin,et al.  Orbits of Orbs: Sphere Packing Meets Penrose Tilings , 2004, Am. Math. Mon..

[31]  L. Jianfei.  Automatic mesh generation of 3-D geometric models , 2003 .

[32]  C. Musès,et al.  The dimensional family approach in (hyper) sphere packing: A typological study for new patterns, structures, and interdimensional functions , 1997 .

[33]  S. Lo.  Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach , 1991 .

[34]  Soon Wan Chung,et al.  A remeshing algorithm based on bubble packing method and its application to large deformation problems , 2003 .

[35]  T. Baker.  Automatic mesh generation for complex three-dimensional regions using a constrained Delaunay triangulation , 1989, Engineering with Computers.

[36]  S. H. Lo.  Generation of high-quality gradation finite element mesh , 1992 .

[37]  Kenji Shimada,et al.  Anisotropic Triangulation of Parametric Surfaces via Close Packing of Ellipsoids , 2000, Int. J. Comput. Geom. Appl..

[38]  N. Weatherill.  The integrity of geometrical boundaries in the two‐dimensional delaunay triangulation , 1990 .

[39]  N. Sapidis,et al.  Combining recursive spatial decompositions and domain Delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models , 1993 .

[40]  S. H. Lo,et al.  Delaunay triangulation of non‐convex planar domains , 1989 .

[41]  P. George,et al.  3D Delaunay mesh generation coupled with an advancing-front approach , 1998 .

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

[43]  P. George,et al.  OPTIMAL DELAUNAY POINT INSERTION , 1996 .