Raytracing irregular volume data
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Arithmetic coding for data compression
Communications of the ACM
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Hierarchical and parallelizable direct volume rendering for irregular and multiple grids
Proceedings of the 7th conference on Visualization '96
Geometric compression through topological surgery
ACM Transactions on Graphics (TOG)
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
A breadth-first approach to efficient mesh traversal
HWWS '98 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Simplification of tetrahedral meshes
Proceedings of the conference on Visualization '98
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
Grow & fold: compression of tetrahedral meshes
Proceedings of the fifth ACM symposium on Solid modeling and applications
Linear complexity hexahedral mesh generation
Selected papers from the 12th annual symposium on Computational Geometry
Tetrahedral mesh compression with the cut-border machine
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Implant sprays: compression of progressive tetrahedral mesh connectivity
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
ZSWEEP: an efficient and exact projection algorithm for unstructured volume rendering
VVS '00 Proceedings of the 2000 IEEE symposium on Volume visualization
On-the-Fly rendering of losslessly compressed irregular volume data
Proceedings of the conference on Visualization '00
Circular incident edge lists: a data structure for rendering complex unstructured grids
Proceedings of the conference on Visualization '01
Compressing polygon mesh geometry with parallelogram prediction
Proceedings of the conference on Visualization '02
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Out-Of-Core Rendering of Large, Unstructured Grids
IEEE Computer Graphics and Applications
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
Simple, Fast, and Robust Ray Casting of Irregular Grids
Dagstuhl '97, Scientific Visualization
Single Resolution Compression of Arbitrary Triangular Meshes with Properties
DCC '99 Proceedings of the Conference on Data Compression
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Streaming compression of tetrahedral volume meshes
GI '06 Proceedings of Graphics Interface 2006
A hexahedral mesh connectivity compression with vertex degrees
Computer-Aided Design
Lossless compression of predicted floating-point geometry
Computer-Aided Design
Hi-index | 0.00 |
Unstructured hexahedral volume meshes are of particular interest for visualization and simulation applications. They allow regular tiling of the three-dimensional space and show good numerical behaviour in finite element computations. Beside such appealing properties, volume meshes take up huge amounts of space when stored in a raw format. In this paper, we present a technique for encoding the connectivity and geometry of unstructured hexahedral volume meshes. For connectivity compression, we generalize the concept of coding with degrees from the surface to the volume case. In contrast to the connectivity of surface meshes, which can be coded as a sequence of vertex degrees, the connectivity of volume meshes is coded as a sequence of edge degrees. This naturally exploits the regularity of typical hexahedral meshes. We achieve compression rates of around 1.5 bits per hexahedron (bph) that go down to 0.18 bph for regular meshes. On our test meshes the average connectivity compression ratio is 1:162.7. For geometry compression, we perform simple parallelogram prediction on uniformly quantized vertices within the side of a hexahedron. Tests show an average geometry compression ratio of 1:3.7 at a quantization level of 16 bits.