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 front method, the technique deals with intersection effectively during mesh generation procedure. The resulting mesh is versatile and robust. The proposed scheme has been realized as computer program. The users only need to input necessary data to achieve the satisfied mesh. At the back of the paper, several examples are given to demonstrate the technique.