Data-dependent tetrahedrization

Kun Lee

doi:10.1117/12.251815

30 September 1996 Data-dependent tetrahedrization

Kun Lee

Proceedings Volume 2826, Vision Geometry V; (1996) https://doi.org/10.1117/12.251815
Event: SPIE's 1996 International Symposium on Optical Science, Engineering, and Instrumentation, 1996, Denver, CO, United States

Abstract

The numerous applications of surface interpolation include the modeling and visualization of physical phenomena. A tetrahedrization is the one of pre-processing steps for 4D surface interpolation. The quality of a piecewise linear interpolation in 4D space depends not only on the distribution of the data points in R³, but also on the data values. One can improve the quality of an approximation by using data dependent criteria. This paper discusses Delaunay tetrahedrization method (sphere criterion) and one of the data dependent tetrahedrization methods (least squares fitting criterion). This paper also discusses new data dependent criteria: (1) gradient difference, and (2) jump in normal direction derivatives.

Citation Download Citation

Kun Lee "Data-dependent tetrahedrization", Proc. SPIE 2826, Vision Geometry V, (30 September 1996); https://doi.org/10.1117/12.251815

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