Generation of triangular mesh with specified size by circle packing

Advances in Engineering Software

Volumn 38, Issue 2, 2007, Pages 133-142

  Wang, W X ^a   Ming, C Y ^b   Lo, S H ^c  

^a INSTITUTE OF SOFTWARE   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

^c UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Advancing front; Boundary recovery; Circle packing; Mesh generation; Parametric surface; Specified size

Indexed keywords

BOUNDARY CONDITIONS; FINITE ELEMENT METHOD; ITERATIVE METHODS; MAPPING;

ADVANCING FRONT; BOUNDARY RECOVERY; CIRCLE PACKING; MESH GENERATION; PARAMETRIC SURFACE; SPECIFIED SIZE;

COMPUTATIONAL GEOMETRY;

EID: 33750037332     PISSN: 09659978     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.advengsoft.2006.04.006     Document Type: Article

References (18)

1. Watson D.F. Computing the n-dimensional Delaunay tessellation with application to voronoi polytopes. Comput J 24 2 (1981) 167-172
2. Yerry M.A., and Shephard M.S. A modified quadtree approach to finite element mesh generation. IEEE Comput Graph Appl 3 1 (1983) 39-46
3. Lo S.H. A new mesh generation scheme for arbitrary planar domains. Int J Numer Methods Eng 21 8 (1985) 1403-1426
4. Frey P.J., and George P.L. Mesh generation: application to finite elements (2000), Hermes Science, Oxford, UK
5. Bern M., Mitchell S., and Ruppert J. Linear-size nonobtuse triangulation of polygons. Discrete Comput Geomet 14 4 (1995) 411-428
6. Eppstein D. Faster circles packing with application to nonobtuse triangulation. Int J Comput Geomet Appl 7 5 (1997) 485-491
7. Bern M., and Eppstein D. Quadrilateral meshing by circle packing. Int J Comput Geomet Appl 10 4 (2000) 347-360
8. Shimada K., Yamada A., and Itoh T. Anisotropic triangulation of parametric surfaces via close packing of ellipsoids. Int J Comput Geomet Appl 10 4 (2000) 417-440
9. Li X.Y., Teng S.H., and Ungor A. Biting: advancing front meets sphere packing. Int J Numer Methods Eng 49 1-2 (2000) 61-81
10. Feng Y.T., Han K., and Owen D.R.J. Filling domains with disks: an advancing front approach. Int J Numer Methods Eng 56 5 (2003) 699-713
11. Muylle J., Ivanyi P., and Topping B.H.V. A new point creation scheme for uniform Delaunay triangulation. Eng Comput 19 5-6 (2002) 707-735
12. Owen S.J., Staten M.L., Canann S.A., and Saigal S. Q-Morph: An indirect approach to advancing front quad meshing. Int J Numer Methods Eng 44 9 (1999) 1317-1340
13. George P.L., Hecht F., and Saltel E. Automatic mesh generator with specified boundary. Comput Methods Appl Mech Eng 92 3 (1991) 269-288
14. Lo S.H., and Wang W.X. An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours. Comput Methods Appl Mech Eng 192 20-21 (2003) 2319-2338
15. Lo S.H., and Wang W.X. Finite element mesh generation over intersecting curved surfaces by tracing of neighbours. Finite Elem Anal Des 41 4 (2005) 351-370
16. Lee C.K. On curvature element-size control in metric surface mesh generation. Int J Numer Methods Eng 50 4 (2001) 787-807
17. Lee C.K. Automatic metric 3D surface mesh generation using subdivision surface geometrical model. Part 1: Construction of underlying geometrical model. Int J Numer Methods Eng 56 11 (2003) 1593-1614
18. Borouchaki H, Laug P, George PL. About parametric surface meshing. In: Second symposium on trends in unstructured mesh generation, USNCCM'99, University of Colorado, Boulder, CO, USA, 1999.