Generation of triangular mesh with specified size by circle packing

Abstract This paper describes an algorithm for the generation of a finite element mesh with a specified element size over an unbound 2D domain using the advancing front circle packing technique. Unlike the conventional frontal method, the procedure does not start from the object boundary but starts from a convenient point within the open domain. As soon as a circle is added to the generation front, triangular elements are directly generated by properly connecting frontal segments with the centre of the new circle. Circles are packed closely and in contact with the existing circles by an iterative procedure according to the specified size control function. In contrast to other mesh generation schemes, the domain boundary is not considered in the process of circle packing, this reduces a lot of geometrical checks for intersection between frontal segments. If the mesh generation of a physical object is required, the object boundary can be introduced. The boundary recovery procedure is fast and robust by tracing neighbours of triangular elements. The finite element mesh generated by circle packing can also be used through a mapping process to produce parametric surface meshes of the required characteristics. The sizes of circles in the pack are controlled by the principal surface curvatures. Five examples are given to show the effectiveness and robustness of mesh generation and the application of circle packing to mesh generation over curved surfaces.

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

[2]  Chi King Lee,et al.  Automatic metric 3D surface mesh generation using subdivision surface geometrical model. Part 1: Construction of underlying geometrical model , 2003 .

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

[4]  Chi King Lee,et al.  On curvature element-size control in metric surface mesh generation , 2001 .

[5]  Mark Yerry,et al.  A Modified Quadtree Approach To Finite Element Mesh Generation , 1983, IEEE Computer Graphics and Applications.

[6]  P. George,et al.  Mesh Generation: Application to Finite Elements , 2007 .

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

[8]  Barry Hilary Valentine Topping,et al.  A new point creation scheme for uniform Delaunay triangulation , 2002 .

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

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

[11]  Marshall W. Bern,et al.  Linear-size nonobtuse triangulation of polygons , 1994, SCG '94.

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

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

[14]  S. H. Lo,et al.  Finite element mesh generation over intersecting curved surfaces by tracing of neighbours , 2005 .

[15]  S. H. Lo,et al.  An algorithm for the intersection of quadrilateral surfaces by tracing of neighbours , 2003 .

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

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