3[2]Lawson C L. Generation of a triangular grid with application to contour plotting[A]. In: Technical Memorandum [C],Institute of Technology, Jet Pollution Laboratory, California,1972:299.
4[3]Lee D T and Schacher B J. Two algorithms for constructing a delaunay triangulation[J]. International Journal of Computer and Information Sciences, 1980,(9 ): 219-242.
5[4]Dawyer R A.A fast divide-and-conquer algorithm for constructing Delaunay triangulations[J].Algorithmica, 1987, (2): 137-151.
6[6]Macedonio G and Pareschi M T. An algorithm for the triangulation of arbitrarily distributed points: applications to volume estimate and terrain fitting[J]. Computers & Geosciences, 1991, 17: 859-874.
7[7]Brassel K E and Reif D. Procedure to generate thissen polygons[J]. Geographical Analysis, 1979,11:289-303.
8[8]Mc Cullagh M J and Ross C G T.Delaunay triangulation of a random data set for is arithmic mapping[J]. The Cartographic Journal,1980, 17:93-99.
9[10]Mirante A and WeinGarten N. The radical sweep algorithm for constructing triangulated irregular networks[J]. IEEE. Computer Graphics and application, 1982:11-21.
10[13]YI Xiao, HONG Yan. Text region extraction in a document image based on the delaunay tessellation[J]. Pattren Recgonition, 2003,36.
