Triangular Meshes for Regions of Complicated Shape
Joe, B and R.B. Simpson
International Journal for Numerical Methods in Engineering, Wiley, Vol 23, pp.751-778, 1986
A method using techniques of computational geometry for triangular mesh generation for regions with complicated polygonal boundaries in the plane is presented. The input to the method includes the desired number of triangles and a mesh smoothness parameter to be specified, as well as the polygonal curves of the region's boundary and possibly, internal interfaces. The triangulation generated conforms to the length scales of the edges of the boundary curves, but the method can be extended to provide additional control of the triangulation by a mesh distribution function. The region is decomposed into convex subregions in two stages, such that triangles of one length scale can be generated i each subregion. The decomposition uses algorithms which run in times that are linear in the number of vertices of the input polygons. Details of two major computational experiments are provided.
Contact author(s) or publisher for availability and copyright information on above referenced article