Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Topological considerations in isosurface generation extended abstract
VVS '90 Proceedings of the 1990 workshop on Volume visualization
On generating topologically consistent isosurfaces from uniform samples
The Visual Computer: International Journal of Computer Graphics
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Time/space tradeoffs for polygon mesh rendering
ACM Transactions on Graphics (TOG)
Optimizing triangle strips for fast rendering
Proceedings of the 7th conference on Visualization '96
Re: additional reference to "marching cubes"
ACM SIGGRAPH Computer Graphics
Hamilton Triangulations for Fast Rendering
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Piggybacking for more efficient parallel out-of-core isosurfacing
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
| Hi-index | 0.00 |
The Marching Cubes (MC) algorithm is a popular approach to extract iso-surfaces from volumetric data. This approach extracts triangles from the volume data for a specific iso-value using a table lookup approach. The lookup entry in the MC is a name value pair, where the name is a number that uniquely identifies a cube topology and the value is the set of triangles for that topology. The MC applies a divide-and-conquer strategy by subdividing the volume into cubes with voxels at each corner of the cube and processes these cubes in a specific order. Thus, for a user specified iso-value, the MC looks up triangles for each cube and thereby generates the whole iso-surface. Most modern graphics hardware renders triangles faster if they are rendered collectively as triangle strips as opposed to individual triangles. Therefore, in this paper we have modified the MC lookup table approach such that the name is the cube topology and the value is a sub-surface piece(s) and its face-index representation. At the time of extraction we tessellate the sub-surface pieces by considering the pieces in the neighboring cubes using the face-index representation and then triangulate these tessellated sub-surface pieces into triangle strips. Our approach is superior to the existing approaches. Its features include: (1) simplicity, (2) procedural triangulation which avoids painful pre-computation, and (3) face-index representation of surface pieces that enables an efficient connection mechanism.