Triangulation of unordered data using trimmed NURBS computer aided design models
暂无分享,去创建一个
[1] Tony DeRose,et al. Surface reconstruction from unorganized points , 1992, SIGGRAPH.
[2] Mihailo Ristic,et al. Efficient registration of NURBS geometry , 1997, Image Vis. Comput..
[3] Y. Yoon,et al. Triangulation of scattered data in 3D space , 1988 .
[4] Crtomir Oblonsek,et al. A Fast Surface-Based Procedure for Object Reconstruction from 3D Scattered Points , 1998, Comput. Vis. Image Underst..
[5] P Cignoni,et al. DeWall: A fast divide and conquer Delaunay triangulation algorithm in Ed , 1998, Comput. Aided Des..
[6] D. Brujic,et al. Monte Carlo simulation and analysis of free-form surface registration , 1997 .
[7] Leila De Floriani,et al. Delaunay-based representation of surfaces defined over arbitrarily shaped domains , 1985, Comput. Vis. Graph. Image Process..
[8] S. Ganapathy,et al. A new general triangulation method for planar contours , 1982, SIGGRAPH.
[9] Jean-Daniel Boissonnat,et al. Geometric structures for three-dimensional shape representation , 1984, TOGS.
[10] Les A. Piegl,et al. Tessellating trimmed surfaces , 1995, Comput. Aided Des..
[11] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[12] Mihailo Ristic,et al. A framework for non-contact measurement and analysis of NURBS surfaces , 1998 .