Marching cubes: surface complexity measure

Sergey V. Matveyev

doi:10.1117/12.342838

25 March 1999 Marching cubes: surface complexity measure

Sergey V. Matveyev

Proceedings Volume 3643, Visual Data Exploration and Analysis VI; (1999) https://doi.org/10.1117/12.342838
Event: Electronic Imaging '99, 1999, San Jose, CA, United States

Abstract

In this work we give an approach to analyze a surface topology complexity inside a cube in the Marching Cube (MC) algorithm. The number of the isosurface intersections with the cube diagonals is used as the complexity criterion. In the case of the trilinear interpolation we have the cubic equation on the each cube diagonal and there is a possibility to find the coordinates of the three intersections with the diagonal of the approximated surface. In the presented work a common technique for choosing the right subcase form the extended lookup table by using a surface complexity criterion is proposed.

Citation Download Citation

Sergey V. Matveyev "Marching cubes: surface complexity measure", Proc. SPIE 3643, Visual Data Exploration and Analysis VI, (25 March 1999); https://doi.org/10.1117/12.342838

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