Share Email Print

Proceedings Paper

Marching cubes: surface complexity measure
Author(s): Sergey V. Matveyev
Format Member Price Non-Member Price
PDF $17.00 $21.00

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

Paper Details

Date Published: 25 March 1999
PDF: 6 pages
Proc. SPIE 3643, Visual Data Exploration and Analysis VI, (25 March 1999); doi: 10.1117/12.342838
Show Author Affiliations
Sergey V. Matveyev, Institute for High-Energy Physics (Russia) and Russian Security Technology Co. (Germany)

Published in SPIE Proceedings Vol. 3643:
Visual Data Exploration and Analysis VI
Robert F. Erbacher; Philip C. Chen; Craig M. Wittenbrink, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?