［1］Joe B. Delaunay triangular meshes in convex polygons [J].SIAM J. Sci. Stat. Comput., 1986,7(2):514～539.
[2]
［3］Joe B. Three dimensional triangulations from local transformations [J]. SIAM J. Sci. Stat. Comput., 1989, 19(4) :718～741.
[3]
［5］Shewchuk J R, Sweep algorithms for constructing higher dimensional constrained Delaunay triangulations [A]. In:Proceedings of the Sixteenth Annual Symposium on Computational Geometry[C], Hong Kong, 2000:350～359.
［12］Hoppe H. Surface reconstruction from unorganized points [D].University of Washington, USA, 1994.
[7]
［14］Lorensen W E, Cline H E. Marching cubes: a high resolution 3D surface construction algorithm [J]. Computer Graphics,1987,21 (4):163～169.
[8]
［2］Joe B. Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation[J]. Int. J. Numer. Methods Eng., 1991,31:987～997.
[9]
［4］Shewchuk J R. A condition guaranteeing the existence of higherdimensional constrained Delaunay triangulations [A]. In:Proceedings of the Fourteenth Annual Symposium on Computational Geometry [C], Minneapolis, Minnesota, USA,1998:76～85.
［7］Barber C B, Dobkin D P, Huhdanpaa H T. The quickhull algorithm for convex hulls [J]. ACM Transactions on Mathematical Software, 1996,22(4) :469～483.
