2Lewis B A,Robinson J S.Triangulation of planar regions with application.The Computer Journal,1978;21(4):324-332.
3Green P J,Sibson R.Computing Dirichlet tessellations in the plane.The Computer Journal,1978;2l(2):l68-173.
4Philip J S,David H E.Geometric Tools for Computer Graphics(计算机图形学几何工具算法详解).周长发译.北京:电子工业出版社,2005.
5Jonathan R S.Triangle a two-dimensional quality mesh generator and Delaunay triangulator.http://www.cs.cmu.edu/~quake/triangle.html.
6Guibas L J, Stolfi J. Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams.ACM Transactions on Graphics, 1985,4(2) :74- 123.
7Dwyer R A. A Faster Divide-and-Conquer Algorithm for Constructing Delaunay Triangulations. Algorithmica, 1987,2(2) : 137 - 151.
8Katajainen J, Koppinen M. Constructing Delaunay Triangulations by Merging Buckets in Quadtree Order. Ann Soc Math Polon Set IV Fund Inform,1988,11(3) :275 - 288.
9Shamos M I, Hoey D. Closest-Point Problems. Proceedings of the 16th IEEE Symposium on Foundations of Computer Science, 1975,151 - 162.
10Lewis B A, Robinson J S. Triangulation of Planar Regions with Application. The Computer Journal, 1978,21 (4):324 -332.
