Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Octrees for faster isosurface generation
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Topological considerations in isosurface generation
ACM Transactions on Graphics (TOG)
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists
IEEE Transactions on Visualization and Computer Graphics
Exploiting Triangulated Surface Extraction Using Tetrahedral Decomposition
IEEE Transactions on Visualization and Computer Graphics
A Near Optimal Isosurface Extraction Algorithm Using the Span Space
IEEE Transactions on Visualization and Computer Graphics
Medical Imaging: Surface Mapping Brain Function on 3D Models
IEEE Computer Graphics and Applications
An Evaluation of Implicit Surface Tilers
IEEE Computer Graphics and Applications
| Hi-index | 0.00 |
The marching cubes (MC) algorithm is widely used for converting volume data into surface data. It generates surfaces with the connected intersection points with a level or value equal to a given threshold. The resulting surfaces are iso-surfaces. However, it will be shown that local volume is not preserved in the conversion. Consequently, the resulting shape is not necessarily close to the original shape. We present a new approach to the problem. Instead of a single threshold value for the entire image we adjust thresholds locally so that local volume becomes approximately equal to the corresponding voxel value. First, a detailed explanationis given using a 2D image. Then, for a 3D case a technique to analytically compute volume in various cases of forming iso-surfaces is developed. We will demonstrate the advantage of our algorithm using several artificial and real examples.