Automatic mesh generation for multiply connected planar regions based on mesh grading propagation

Automatic mesh generation is one of the most important parts in CIMs (Computer Integrated Manufacturing System). A method based on mesh grading propagation which automatically produces a triangular mesh in a multiply connected planar region is presented in this paper. Its core part is an algorithm for triangulating convex polygons. Making use of the shrinking polygons of a convex polygon and the mesh grading propagation rules, the algorithm automatically propagates boundary gradings into the interior of the region and generates meshes whose elements are close to the equilateral triangle in linear time, meanwhile sizes of elements between dense meshes and sparse meshes vary smoothly. The algorithm is incorporated with domain decomposition techniques to generate satisfactory quasi-uniform meshes for 2D arbitrary domains. Experiment results show that its running time is linear with both the number of nodes and the number of elements when generating meshes of different mesh densities for the same arbitrary domain. Copyright (C) 1996 Elsevier Science Ltd