Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Local bisection refinement for N-simplicial grids generated by reflection
SIAM Journal on Scientific Computing
Multiresolution tetrahedral framework for visualizing regular volume data
VIS '97 Proceedings of the 8th conference on Visualization '97
Interval volume tetrahedrization
VIS '97 Proceedings of the 8th conference on Visualization '97
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Proceedings of the conference on Visualization '00
Isosurfacing in higher dimensions
Proceedings of the conference on Visualization '00
Interactive view-dependent rendering of large isosurfaces
Proceedings of the conference on Visualization '02
Volumetric Data Exploration Using Interval Volume
IEEE Transactions on Visualization and Computer Graphics
Adaptive and quality 3D meshing from imaging data
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Interval Set: A Volume Rendering Technique Generalizing Isosurface Extraction
VIS '95 Proceedings of the 6th conference on Visualization '95
Interval volume: a solid fitting technique for volumetric data display and analysis
VIS '95 Proceedings of the 6th conference on Visualization '95
Topological Volume Skeletonization Using Adaptive Tetrahedralization
GMP '04 Proceedings of the Geometric Modeling and Processing 2004
Adaptive Extraction of Time-Varying Isosurfaces
IEEE Transactions on Visualization and Computer Graphics
Diamond hierarchies of arbitrary dimension
SGP '09 Proceedings of the Symposium on Geometry Processing
Hi-index | 0.00 |
Interval volumes are a generalization of isosurfaces that represent the set of points between two surfaces. In this paper, we present a compact multi-resolution representation for interval volume meshes extracted from regularly sampled volume data sets. The multi-resolution model is a hierarchical tetrahedral mesh whose updates are based on the longest edge bisection (LEB) subdivision strategy for tetrahedra. Although our representation is decoupled from the scalar field, it maintains the implicit structure of the LEB model to efficiently encode mesh updates. Our representation efficiently supports selective refinement queries and requires significantly less storage than an encoding of the interval volume mesh at full resolution.