1Cavendish J C. Automatic triangulation of arbitrary planar domains for the finite element method[J]. International Journal for Numerical Methods in Engineering, 1974(8):679-696.
2Shaw R D, Pitchen R G. Modifications to the Suhara-Fukuda method of network generation[J]. International Journal for Numerical Methods in Engineering, 1978(12):93-99.
3Lo S H. A new mesh generation scheme for arbitrary planar domains[J]. International Journal for Numerical Methods in Engineering, 1985(21):1403-1426.
4Barry Joe. Tetrahedral mesh generation in polyhedral regions based on convex polyhedron decompositions[J]. International Journal for Numerical Methods in Engineering, 1994,37(4):693-713.
5Sapidis, Renato Perucchio. Combining recursive spatial decomposition's and domain delaunay tetrahedrizations for meshing arbitrarily shaped curved solid models[J]. Comp. Meth. in applied mech. and Eng.,1993,108:281-302.
6Wordenweber B. Finite element mesh generation[J]. CAD, 1984, 16(5): 285-291.
7Bykat A. Automatic generation of triangular grid: Ⅰ-subdivision of a general polygon into convex subregions. Ⅱ-triangulation of convex polygons [J]. Int. J. Numer. Meth. Eng., 1976,10:1329-1342.
8Bykat A. Design of a recursive shape controlling mesh generator[J]. Int. J. Numer. Meth. Eng., 1983,19:1375-1390.
9Sluiter M L C, Hansen D L. A general purpose automatic mesh generator for shell and solid finite elements[J]. Computers in Engineering ASME,1982,3:29-34.
10Thacker W C, et al. A method for automating the construction of irregular computational grids for storm surge forecast models[J]. Journal of Computational Physics, 1980,37: 371-387.
2D. T. Lee,B. J. Schachter. Two algorithms for constructing a Delaunay triangulation[J] 1980,International Journal of Computer & Information Sciences(3):219～242
