1 August 1990 Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation
Author Affiliations +
Abstract
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 Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Leonardo Traversoni, "Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation", Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); doi: 10.1117/12.19732; https://doi.org/10.1117/12.19732
PROCEEDINGS
6 PAGES


SHARE
Back to Top