Automatic generation of triangular mesh utilizing the bucket method for finite element method

In this paper we describe an algorithm for generating a triangular mesh wit hin an arbitrary planar domain. When is applied the finite element method t o numerical simulation, the discretization of the domain becomes on essenti al part of the procedure. There are many reports on automatic mesh generati on methods, such as coordinate transformation, blending function, the Quadt ree method, the Delaunay method, and the advancing front method. The main c haracteristic of the proposed algorithm is that the position of the nodes i s generated in the original polygonal region as much as possible in the for m of an equilateral triangle and the triangulation of the inner nodes is ca rried out by the bucket method of computational geometry prior to the globa l construction of the triangular mesh model. Then the triangulation of the remaining region is carried out utilizing the advancing front method. The p rocessing scheme is developed and applied to several examples. The numerica l results are demonstrated and the effectiveness is discussed.