Share Email Print

Proceedings Paper

Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation
Author(s): Leonardo Traversoni
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 1 August 1990
PDF: 6 pages
Proc. SPIE 1251, Curves and Surfaces in Computer Vision and Graphics, (1 August 1990); doi: 10.1117/12.19732
Show Author Affiliations
Leonardo Traversoni, Univ. Autonoma Metropolitana/Iztapalapa (Mexico)

Published in SPIE Proceedings Vol. 1251:
Curves and Surfaces in Computer Vision and Graphics
Leonard A. Ferrari; Rui J. P. de Figueiredo, Editor(s)

© SPIE. Terms of Use
Back to Top