6Andre Meyer,Philippe Matin.Segmentation of 3D Triangulated Data Points Using Edges Constructed with a C1 Discontinuous Surface Fitting[J].Computer Aided Design,2004,36 (13):1327-1336.
4Lorensen W E, Cline H E. Marching cubes: a high resolution 3D surface construction algorithm[J]. Computer Graphics, 1987,21 (4) : 163.
5Doi A, Koide A. An effective method of triangulation equi-valued surfaces by using tetrahedral cells [J]. IEICE Transactions, 1991, E74(1): 214.
6Giertsen C. Volume visualization of sparse irregular meshes [J]. IEEE Computer Graphics & Application, 1992,12(2) : 40.
7Max N,Hanrahan P,Crawfis R. Area and volume coherence for efficient visualization of 3D scalar function [J ]. Computer Graphics, 1990,24(5) : 17.
8Cline H E, Lorensen W E. Two algorithms for three- dimensional reconstruction of tomograms[J]. Medical Physics, 1988,15(3) :320.
9Douglas D H, Peucker T K. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature[J]. The Canadian Cartographer, 1973,10(2) : 112.
10Ekoule A B, Peyrin F C, Odet C L. A triangulation algorithm from arbitrary shaped multiple planar contours [ J ]. ACM Transactions on Graphics, 1991, (10) : 182.
