A fast and practical method to pack spheres for mesh generation

Sphere packing is an attractive way to generate high quality mesh. Several algorithms have been proposed in this topic, however these algorithms are not sufficiently fast for large scale problems. The paper presents an efficient sphere packing algorithm which is much faster and appears to be the most practical among all sphere packing methods presented so far for mesh generation. The algorithm packs spheres inside a domain using advancing front method. High efficiency has resulted from a concept of 4R measure, which localizes all the computations involved in the whole sphere packing process.

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

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

[3]  Dean L. Taylor,et al.  A theorem to determine the spatial containment of a point in a planar polyhedron , 1989, Comput. Vis. Graph. Image Process..

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

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

[6]  Kenji Shimada,et al.  Skeleton-based computational method for the generation of a 3D finite element mesh sizing function , 2004, Engineering with Computers.

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

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

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

[10]  Kenji Shimada,et al.  Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing , 1995, SMA '95.

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

[12]  Kenji Shimada,et al.  Automatic triangular mesh generation of trimmed parametric surfaces for finite element analysis , 1998, Comput. Aided Geom. Des..

[13]  Charles Boivin,et al.  Guaranteed-Quality Simplical Mesh Generation with Cell Size and Grading Control , 2001, Engineering with Computers.

[14]  Xiang-Yang Li,et al.  Biting Spheres in 3D , 1999, IMR.

[15]  Sun Shuli,et al.  Optimal Tetrahedralization for Small Polyhedron: A New Local Transformation Strategy for 3-D Mesh Generation and Mesh Improvement , 2006 .

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

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

[18]  W. X. Wang,et al.  Generation of triangular mesh with specified size by circle packing , 2007, Adv. Eng. Softw..

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

[20]  Kenji Shimada,et al.  Anisotropic tetrahedral meshing via bubble packing and advancing front , 2003 .

[21]  S. H. Lo,et al.  Generation of tetrahedral mesh of variable element size by sphere packing over an unbounded 3D domain , 2005 .