Automatic triangulation of an arbitrary 2D domain

A triangular mesh generator, capable of discretizing arbitrary, two-dimensional, multiply connected domains has been developed. The paper presents a method to dispose complex regions without subdivision by identification of the concave nodes and the introduction of cut-lines. On the basis of advancing the front method, the technique deals with intersection effectively during the mesh generation procedure. The resulting mesh is versatile and robust. Several examples are given to demonstrate the technique