Miles R E.Solution to Problem 67-15 (Probability Distribution of a Network of Triangles)[J].SIAM,1969,11(3):399 ～ 402.
[2]
Lingas A.The greedy and Delaunay triangulations are not bad in the average case[J].Information Processing Letters,1986,22 (1):25 ～ 31.
[3]
Joe B.Delaunay triangular meshes in convex polygons[J].SIAM Journal of Scientific Computing,1986,7(2):514 ～ 539.
[4]
Zheng Shun-yi,Su Guo-zhong,Zhang Zu-xun.Automatic reconstruction of 3D surface model with 3D irregular points based on projection constrain[J].Geomatics and Information Science of Wuhan University,2005,30(2):154～157.[郑顺义,苏国中,张祖勋.三维点集的自动表面重构算法[J].武汉大学学报(信息科学版),2005,30(2):154 ～ 157.]
[5]
Ho-Le K.Finite element mesh generation methods:a review and classification[J].Computer-Aided Design,1988,20(1):27 ～ 37.
Tsai V J D.Delaunay triangulations in TIN creation:an overview and linear-time algorithm[J].International Journal of GIS,1993,7 (6):501 ～ 524.
[8]
Joe B.Delaunay versus max-min solid angle triangulation for threedimensional mesh generation[J].International Journal of Number Methods in Engineering,1991,31(1):987 ～ 997.
[9]
Ji Feng-xin,Ou Zong-ying,Qin Xu-jia,et al.An algorithm of reconstructing 3D surface from discrete data of layered images based on delaunay triangulation[J].Journal Of Engineering Graphics,2001,22(2):53～58.[纪凤欣,欧宗瑛,秦绪佳等.基于Delaunay三角剖分的层析图像离散数据表面重建算法[J].工程图学学报,2001,22(2):53 ～ 58.]
[10]
Cui Han-guo,Hu Rui-an,Jin Rui-feng.Delaunay triangulation of arbitrarily shaped cubic domains[J].Journal of Computer Aided Design and Graphics,1995,7(2):103～108.[崔汉国,胡瑞安,金瑞峰.3维任意区域中点集的三角剖分算法[J].计算机辅助设计与图形学学报,1995,7(2):103 ～ 108.]
