Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation

Leonardo Traversoni

doi:10.1117/12.19732

1 August 1990 Delaunay's tetrahedronalization: an efficient algorithm for 3-D triangulation

Leonardo Traversoni

Proceedings Volume 1251, Curves and Surfaces in Computer Vision and Graphics; (1990) https://doi.org/10.1117/12.19732
Event: Electronic Imaging: Advanced Devices and Systems, 1990, Santa Clara, CA, United States

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.

Citation Download Citation

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); https://doi.org/10.1117/12.19732

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available