Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation
Leonardo Traversoni · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1990
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.© (1990) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.