Automatic mesh generation for planar structures based on contours, adaptive grid and the Delaunay condition

A surface meshing algorithm that yields a mixed triangular-rectangular mesh is presented and described in detail in this paper. The algorithm, named CGSM, can mesh any arbitrarily-shaped planar structure described with segments and arcs. It also provides the so-called “edge meshing,” i.e. denser meshing near edges of the structure. A similar approach is used within commercial software (e.g. IE3D). However, the CGSM algorithm uses an adaptive grid for inserting rectangles and imposes the Delaunay condition on triangles, and hence in less time it usually yields more regular mesh with fewer cells than e.g. IE3D.