Generation of finite element mesh with variable size over an unbounded 2D domain

Computer Methods in Applied Mechanics and Engineering

Volumn 194, Issue 45-47, 2005, Pages 4668-4684

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF SOFTWARE   (China)

Author keywords

Advancing front; Boundary recovery; Circle packing; Neighbour tracing; Triangular mesh generation; Unbounded domain

Indexed keywords

FINITE ELEMENT METHOD; GEOMETRY; PACKING;

BOUNDARY RECOVERY PROBLEMS; CIRCLE PACKING; DOMAIN BOUNDARIES; FINITE ELEMENT MESHES;

FLUID DYNAMICS;

FINITE ELEMENT METHOD;

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

References (35)

1. A. Kela R. Perucchio H. Voelcher Towards automatic finite element analysis Comp. Mech. Eng. 1986 57-71
2. D.F. Watson Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes Comput. J. 24 2 1981 167-172
3. J. Peraire K. Morgan Unstructured mesh generation including directional refinement for dynamic flow simulation Finite Elements Anal. Des. 25 3-4 1997 343-356
4. J.C. Cavendish D.A. Field W.H. Frey An approach to automatic 3-dimensional finite-element mesh generation Int. J. Numer. Meth. Engrg. 21 2 1985 329-347
5. S.H. Lo Delaunay triangulation of non-convex planar domains Int. J. Numer. Meth. 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. T.J. Baker Shape reconstruction and volume meshing for complex solids Int. J. Numer. Meth. Engrg. 32 1991 665-675
8. P.L. George H. Borouchaki E. Saltel Ultimate' robustness in meshing an arbitrary polyhedron Int. J. Numer. Meth. Engrg. 58 7 2003 1061-1089
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. Numer. Meth. Engrg. 39 20 1996 3407-3437
11. H. Borouchaki P.L. George Aspects of 2-D Delaunay mesh generation Int. J. Numer. Meth. Engrg. 40 11 1997 1957-1975
12. S.H. Lo A new mesh generation scheme for arbitrary planar domains Int. J. Numer. Meth. Engrg. 21 8 1985 1403-1426
13. J.Z. Zhu O.C. Zienkiewicz E. Hinton J. Wu A new approach to the development of automatic quadrilateral mesh generation Int. J. Numer. Meth. Engrg. 32 4 1991 849-866
14. C.K. Lee S.H. Lo A new scheme for the generation of a graded quadrilateral mesh Comput. Struct. 52 5 1994 847-857
15. R. Lohner Extensions and improvements of the advancing front grid generation technique Commun. Numer. Meth. Engrg. 12 10 1996 683-702
16. R. Lohner Progress in grid generation via the advancing front technique Engrg. Comput. 12 3-4 1996 186-210
17. S.J. Owen M.L. Staten S.A. Canann S. Saigal Q. Morph An indirect approach to advancing front quad meshing Int. J. Numer. Meth. Engrg. 44 9 1999 1317-1340
18. R. Lohner P. Parikh Generation of 3-dimensional unstructured grids by the advancing-front method Int. J. Numer. Meth. Fluids 8 10 1988 1135-1149
19. S.H. Lo Volume discretization into tetrahedra - II. 3d triangulation by advancing front approach Comput. Struct. 39 5 1991 501-511
20. S.H. Lo Generation of high-quality gradation finite-element mesh Engrg. Fract. Mech. 41 2 1992 191-202
21. T.S. Lau S.H. Lo Finite element mesh generation over analytical curved surfaces Comput. Struct. 59 2 1996 301-309
22. A. Rassineux Generation and optimization of tetrahedral meshes by advancing front technique Int. J. Numer. Meth. Engrg. 41 4 1998 651-674
23. 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
24. M. Bern S. Mitchell J. Ruppert Linear-size nonobtuse triangulation of polygons Discr. Comput. Geom. 14 4 1995 411-428
25. D. Eppstein Faster circles packing with application to nonobtuse triangulation Int. J. Comput. Geom. Appl. 7 5 1997 485-491
26. M. Bern D. Eppstein Quadrilateral meshing by circle packing Int. J. Comput. Geom. Appl. 10 4 2000 347-360
27. K. Shimada A. Yamada T. Itoh Anisotropic triangulation of parametric surfaces via close packing of ellipsoids Int. J. Comput. Geom. Appl. 10 4 2000 417-440
28. 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
29. X.Y. Li S.H. Teng A. Ungor Biting: Advancing front meets sphere packing Int. J. Numer. Meth. Engrg. 49 1-2 2000 61-81
30. 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
31. A. Yamada K. Shimada T. Itoh Meshing curved wire-frame models through energy minimization and packing of ellipses Int. J. Numer. Meth. Engrg. 46 1999 1221-1236
32. Y.T. Feng K. Han D.R.J. Owen Filling domains with disks: An advancing front approach 56 5 2003 699-713
33. P.L. George F. Hecht E. Saltel Automatic mesh generator with specified boundary Comput. Methods Appl. Mech. Engrg. 92 3 1991 269-288
34. S.H. Lo J.F. Liu Automatic mesh generation on a regular background grid J. Comput. Sci. Technol. 17 6 2002 882-887
35. S.H. Lo W.X. Wang An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours Comput. Methods Appl. Mech. Engrg. 192 20-21 2003 2319-2338