Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation
暂无分享，去创建一个
Our objective is to show that tetrahedronalization of a convex volume of which we know some points in its surface is an efficient way of triangulating the surface.
[1] D. T. Lee,et al. Computational Geometry—A Survey , 1984, IEEE Transactions on Computers.
[2] Charles L. Lawson,et al. $C^1$ surface interpolation for scattered data on a sphere , 1984 .
[3] Y. Yoon,et al. Triangulation of scattered data in 3D space , 1988 .
[4] Robert J. Renka,et al. Algorithm 623: Interpolation on the Surface of a Sphere , 1984, TOMS.