[1] 胡鹏,杨传勇,吴艳兰等.新数字高程模型:理论、方法、标准和应用[M].北京：测绘出版社，2007.2.
[2] 张宏,温永宁,刘爱利等.地理信息系统算法基础[M].北京：科学出版社，2006.6.
[3] 凌海滨,吴兵.改进的自连接Delaunay三角网生成算法[J].计算机应用，1999.19(12):10~12.
[4] Lawson C.L.A software for C surface interpolation[J].Mathematical Software III,1977: 161~194.
[5] Lee D T, Schachter B J. Two algorithms for constructing a Delaunay triangulation[J]. International Journal of Computer and Information Science, 1980,9(3):219~242.
[6] Bowyer A. Computing Dirichlet Tesselations[J]. Computer Journal,1981(24) :162~166.
Watson D F. Computing the n-dimension Delaunay Tesselation with Application to Voronoi Polytopes[J]. Computer Journal,1981(24) :167~172.
[7] Macedonia G, 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.
[8] Floriani L.D. and Puppo E. An on-line Algorithm for Constrained Delaunay Triangulation[J]. CVGIP: Graphical Models and Image Processing, 1992, 54(3) : 290~300.
[9] 武晓波,王世新,肖春生.Delaunay 三角网的生成算法研究[J].测绘学报,1999.28(1):28~35.
[10] McCullagh MJ,Ross CGT.Delaunay triangulation of a random data set for Iirarithmic mapping [J].The Cartographic Journal,1980,17:93~99.
[11] Mirante A,WeinGarten N.The radical sweep algorithm for constructing triangulated irregular networks[J]. IEEE.Computer Graphics and application,1982:11~21.
[12] 芮一康,王结臣.Delaunay三角形构网的分治扫描线算法[J].测绘学报,2007.36(3):358~362.
[13] George T.Heineman,Gary Pollice,Stanley Selkow著.杨晨,李明译.算法技术手册[M].北京：机械工业出版社，2010.3.
[14] 徐道柱,刘海砚.Delaunay三角网建立的改进算法[J].测绘与空间地理信息,2007.30(1)：38~41.
[15] 魏向辉,夏春林,鲁庆.一种基于凸包的Delaunay三角网算法设计[J].测绘科学,2010.35(5):152~153.
[16] 邵春丽,胡鹏,黄承义,彭琪.Delaunay三角网的算法详述及其应用发展前景[J].测绘科学，2004.29(6):68~71.
[17] 余杰,吕品,郑昌文.Delaunay三角网构建方法比较研究[J].中国图象图形学报,2010.15(8):1158~1167.