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
ACM Transactions on Graphics (TOG)
Adaptive generation of surfaces in volume data
The Visual Computer: International Journal of Computer Graphics
Octree-based decimation of marching cubes surfaces
Proceedings of the 7th conference on Visualization '96
Using distance maps for accurate surface representation in sampled volumes
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Adaptively sampled distance fields: a general representation of shape for computer graphics
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Kizamu: a system for sculpting digital characters
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Feature sensitive surface extraction from volume data
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Dual contouring of hermite data
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Cell Octrees: A New Data Structure for Volume Modeling and Visualization
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
VIS '04 Proceedings of the conference on Visualization '04
Feature-Sensitive Subdivision and Isosurface Reconstruction
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Hi-index | 0.00 |
Volume data are usually represented as a uniform structured grid. Nevertheless, this representation imposes large memory requirements when large volumes are stored. Hierarchical representations can be used to reduce either memory requirements or rendering time. They have been used as index to the cell grid, but this increases memory requirements, as both the tree and the grid must be stored. They have also been used as a direct representation of the volume model, but this makes the surface extraction process more complex, as cracks may appear on the boundaries of different-sized cells. A dual cell method has been proposed to solve the problems of cracks, but this approach requires the explicit generation of a dual grid, which also increases memory requirements. This paper presents a new, octree based, multi-resolution representation for volumes that do not need to store the dual cell grid, while generating high-quality crack-free isosurfaces. Our proposal utilizes a dual cell grid that is implicitly stored in the tree using just one byte per leaf node. Isosurfaces are built on the fly from these implicitly stored dual cells when the voxel octree is traversed.