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

Computer Methods in Applied Mechanics and Engineering

Volumn 194, Issue 48-49, 2005, Pages 5002-5018

  Lo, S H ^a   Wang, W X ^b  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

Delaunay triangulation; Descend by rotation; Frontal surface; Sphere packing; Tetrahedral mesh; Unbounded 3D domain

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; DATA STRUCTURES; FINITE ELEMENT METHOD; ITERATIVE METHODS; OPTIMIZATION;

DELAUNAY TRIANGULATION; FRONTAL SURFACE; SPHERE PACKING; TETRAHEDRAL MESH;

COMPUTER SIMULATION;

MODELING;

EID: 24044449651     PISSN: 00457825     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cma.2004.11.022     Document Type: Article

References (46)

1. N. Sapidis R. Perucchio Combining recursive spatial decomposition and domain Delaunay tetrahedralization for meshing arbitrary shaped solid models Comput. Methods Appl. Mech. Engrg. 108 1993 282-302
2. D.F. Watson Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes Comput. J. 24 2 1981 167-172
3. Z.J. Cendes D. Shenton H. Shahnasser Magnetic-field computation using Delaunay triangulation and complementary finite-element methods IEEE Trans. Magn. 19 6 1983 2551-2554
4. J.C. Cavendish D.A. Field W.H. Frey An approach to automatic 3-dimensional finite-element mesh generation Int. J. Num. Methods Engrg. 21 2 1985 329-347
5. S.H. Lo Delaunay triangulation of non-convex planar domains Int. J. Num. Methods Engrg. 28 11 1989 2695-2707
6. T.J. Baker Automatic mesh generation for complex 3-dimensional regions using a constrained delaunay triangulation Engrg. Comput. 5 3-4 1989 161-175
7. N.P. Weatherill The integrity of geometrical boundaries in the 2-dimensional Delaunay triangulation Commun. Appl. Num. Methods 6 2 1990 101-109
8. N.P. Weatherill O. Hassan Efficient 3-dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints Int. J. Num. Methods Engrg. 37 12 1994 2005-2039
9. H. Borouchaki S.H. Lo Fast Delaunay triangulation in three dimensions Comput. Methods Appl. Mech. Engrg. 128 1-2 1995 153-167
10. H. Borouchaki P.L. George S.H. Lo Optimal Delaunay point insertion Int. J. Num. Methods Engrg. 39 20 1996 3407-3437
11. H. Borouchaki P.L. George Aspects of 2-D Delaunay mesh generation Int. J. Num. Methods Engrg. 40 11 1997 1957-1975
12. P.L. George F. Hecht E. Saltel Automatic mesh generator with specified boundary Comput. Methods Appl. Mech. Engrg. 92 3 1991 269-288
13. J.R. Shewchuk, Constrained Delaunay tetrahedralizations and provably good boundary recovery, in: 11th International Meshing Roundtable, Ithaca, New York, USA, September 2002.
14. S.H. Lo A new mesh generation scheme for arbitrary planar domains Int. J. Num. Methods Engrg. 21 8 1985 1403-1426
15. J.Z. Zhu O.C. Zienkiewicz E. Hinton J. Wu A new approach to the development of automatic quadrilateral mesh generation Int. J. Num. Methods Engrg. 32 4 1991 849-866
16. C.K. Lee S.H. Lo A new scheme for the generation of a graded quadrilateral mesh Comput. Struct. 52 5 1994 847-857
17. R. Lohner Extensions and improvements of the advancing front grid generation technique Commun. Num. Methods Engrg. 12 10 1996 683-702
18. R. Lohner Progress in grid generation via the advancing front technique Engrg. Comput. 12 3-4 1996 186-210
19. S.J. Owen M.L. Staten S.A. Canann S. Saigal Q-Morph: An indirect approach to advancing front quad meshing Int. J. Num. Methods Engrg. 44 9 1999 1317-1340
20. R. Lohner P. Parikh Generation of 3-dimensional unstructured grids by the advancing-front method Int. J. Num. Methods Fluids 8 10 1988 1135-1149
21. S.H. Lo Volume discretization into tetrahedra-II. 3d triangulation by advancing front approach Comput. Struct. 39 5 1991 501-511
22. S.H. Lo Generation of high-quality gradation finite-element mesh Engrg. Fract. Mech. 41 2 1992 191-202
23. T.S. Lau S.H. Lo Finite element mesh generation over analytical curved surfaces Comput. Struct. 59 2 1996 301-309
24. A. Rassineux Generation and optimization of tetrahedral meshes by advancing front technique Int. J. Num. Methods Engrg. 41 4 1998 651-674
25. P.J. Frey H. Borouchaki P.L. George 3D Delaunay mesh generation coupled with an advancing-front approach Comput. Methods Appl. Mech. Engrg. 157 1-2 1998 115-131
26. M. Bern S. Mitchell J. Ruppert Linear-size nonobtuse triangulation of polygons Discr. Computat. Geometry 14 4 1995 411-428
27. D. Eppstein Faster circles packing with application to nonobtuse triangulation Int. J. Computat. Geometry Appl. 7 5 1997 485-491
28. M. Bern D. Eppstein Quadrilateral meshing by circle packing Int. J. Computat. Geometry Appl. 10 4 2000 347-360
29. K. Shimada A. Yamada T. Itoh Anisotropic triangulation of parametric surfaces via close packing of ellipsoids Int. J. Computat. Geometry Appl. 10 4 2000 417-440
30. J.H. Kim H.G. Kim B.C. Lee S. Im Adaptive mesh generation by bubble packing method Struct. Engrg. Mech. 15 1 2003 135-149
31. X.Y. Li S.H. Teng A. Ungor Biting: Advancing front meets sphere packing Int. J. Num. Methods Engrg. 49 1-2 2000 61-81
32. S.W. Chung S.J. Kim A remeshing algorithm based on bubble packing method and its application to large deformation problems Finite Elements Anal. Des. 39 4 2003 301-324
33. J.F. Liu Automatic mesh generation of 3-D geometric models Acta Mech. Sin. 19 3 2003 285-288
34. Y.T. Feng K. Han D.R.J. Owen Filling domains with disks: An advancing front approach Int. J. Num. Methods Engrg. 56 5 2003 699-713
35. C. Muses A sphere-packing breakthrough via dimensional families Appl. Math. Commun. 83 1997 1-2
36. C. Muses The Dimensional Family Approach in (hyper) sphere packing: A topological study of new patterns, structures, and interdimensional functions Appl. Math. Commun. 88 1997 1-26
37. E. Cockayne M. Mihalkovic Stable quasicrystalline sphere packing Philos. Mag. Lett. 79 7 1999 441-448
38. C. Radin, Orbit of orbs: Sphere packing meets Penrose Tilings, The American Mathematical Monthly; February 2004, 111, 2; Academic Research Library, p. 137.
39. H. Sowa E. Koch Hexagonal and trigonal sphere packings. II. Bivariant lattice complexes Acta Cryst. A60 2004 158-166
40. S.P. Li Ka-Lok Ng Monte Carlo study of the sphere packing problem Physica A321 2003 359-363
41. S.P. Li K.-L. Ng Study of the unequal spheres packing problem: An application to radio-surgery treatment Int. J. Mod. Phys. C 14 6 2003 815-823
42. A. Sutou Y. Dai Global optimization approach to unequal sphere packing problems in 3D J. Optim. Appl. 114 3 2002 671-684 September
43. A. Donev S. Torquato F.H. Stillinger R. Connelly A linear programming algorithm to test for jamming in hard-sphere packings J. Computat. Phys. 197 2004 139-166
44. S.H. Lo, W.X. Wang, Generation of finite element mesh with variable size over an unbounded 2D domain, Comput. Methods Appl. Mech. Engrg., in press, doi:10.1016/j.cma.2004.12.011.
45. S.H. Lo J.F. Liu Automatic mesh generation on a regular background grid J. Comput. Sci. Technol. 17 6 2002 882-887
46. S.H. Lo Optimization of tetrahedral meshes based on element shape measures Comput. Struct. 63 5 1997 951-961