25 March 1999 Marching cubes: surface complexity measure
Author Affiliations +
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.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sergey V. Matveyev, "Marching cubes: surface complexity measure", Proc. SPIE 3643, Visual Data Exploration and Analysis VI, (25 March 1999); doi: 10.1117/12.342838; https://doi.org/10.1117/12.342838

Back to Top