Visibility-ordering meshed polyhedra
ACM Transactions on Graphics (TOG)
Arithmetic coding for data compression
Communications of the ACM
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Progressive simplicial complexes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Multiresolution tetrahedral framework for visualizing regular volume data
VIS '97 Proceedings of the 8th conference on Visualization '97
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
Progressive tetrahedralizations
Proceedings of the conference on Visualization '98
Multiresolution Representation and Visualization of Volume Data
IEEE Transactions on Visualization and Computer Graphics
DECIMATION OF TETRAHEDRAL GRIDS WITH ERROR CONTROL
DECIMATION OF TETRAHEDRAL GRIDS WITH ERROR CONTROL
On-the-Fly rendering of losslessly compressed irregular volume data
Proceedings of the conference on Visualization '00
Progressive lossless compression of arbitrary simplicial complexes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
An out-of-core method for computing connectivities of large unstructured meshes
EGPGV '02 Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
TetFusion: an algorithm for rapid tetrahedral mesh simplification
Proceedings of the conference on Visualization '02
Representing Vertex-Based Simplicial Multi-complexes
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Representing vertex-based simplicial multi-complexes
Digital and image geometry
Out-of-core encoding of large tetrahedral meshes
VG '03 Proceedings of the 2003 Eurographics/IEEE TVCG Workshop on Volume graphics
Compressing hexahedral volume meshes
Graphical Models - Special issue on Pacific graphics 2002
Streaming compression of tetrahedral volume meshes
GI '06 Proceedings of Graphics Interface 2006
Segment-based tetrahedral meshing and rendering
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Interactive Point-Based Rendering of Higher-Order Tetrahedral Data
IEEE Transactions on Visualization and Computer Graphics
Fast and Efficient Compression of Floating-Point Data
IEEE Transactions on Visualization and Computer Graphics
Mesh connectivity compression using convection reconstruction
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Journal of Visual Communication and Image Representation
ACM Transactions on Graphics (TOG)
A hexahedral mesh connectivity compression with vertex degrees
Computer-Aided Design
SOT: compact representation for tetrahedral meshes
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Lossless compression of predicted floating-point geometry
Computer-Aided Design
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
A spatio-temporal metric for dynamic mesh comparison
AMDO'06 Proceedings of the 4th international conference on Articulated Motion and Deformable Objects
Lossless geometry compression for steady-state and time-varying irregular grids
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
An architecture for interactive tetrahedral volume rendering
VG'01 Proceedings of the 2001 Eurographics conference on Volume Graphics
An integrated pipeline of decompression, simplification and rendering for irregular volume data
VG'05 Proceedings of the Fourth Eurographics / IEEE VGTC conference on Volume Graphics
| Hi-index | 0.00 |
In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine tetrahedral meshes consume several mega-bytes of storage. For archivation and transmission compression algorithms are essential. In scientific applications lossless compression schemes are of primary interest. This paper introduces a new lossless compression scheme for the connectivity of tetrahedral meshes. Our technique can handle all tetrahedral meshes in three dimensional euclidean space even with non manifold border. We present compression and decompression algorithms which consume for reasonable meshes linear time in the number of tetrahedra. The connectivity is compressed to less than 2.4 bits per tetrahedron for all measured meshes. Thus a tetrahedral mesh can almost be reduced to the vertex coordinates, which consume in a common representation about one quarter of the total storage space.We complete our work with solutions for the compression of vertex coordinates and additional attributes, which might be attached to the mesh.