SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Grow & fold: compression of tetrahedral meshes
Proceedings of the fifth ACM symposium on Solid modeling and applications
Tetrahedral mesh compression with the cut-border machine
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
On-the-Fly rendering of losslessly compressed irregular volume data
Proceedings of the conference on Visualization '00
Compressing large polygonal models
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 compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Compressing hexahedral volume meshes
Graphical Models - Special issue on Pacific graphics 2002
Encoding Volumetric Grids For Streaming Isosurface Extraction
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
TetStreamer: Compressed Back-to-Front Transmission of Delaunay Tetrahedra Meshes
DCC '05 Proceedings of the Data Compression Conference
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Streaming compression of triangle meshes
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Lossless compression of predicted floating-point geometry
Computer-Aided Design
Fast and Efficient Compression of Floating-Point Data
IEEE Transactions on Visualization and Computer Graphics
Robust on-line computation of Reeb graphs: simplicity and speed
ACM SIGGRAPH 2007 papers
Multilevel streaming for out-of-core surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Processing of volumetric data by slice- and process-based streaming
AFRIGRAPH '07 Proceedings of the 5th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa
Streaming tetrahedral mesh optimization
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Streaming Mesh Optimization for CAD
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
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
Out-of-core simplification and crack-free LOD volume rendering for irregular grids
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
Geometry processing algorithms have traditionally assumed that the input data is entirely in main memory and available for random access. This assumption does not scale to large data sets, as exhausting the physical memory typically leads to IO-inefficient thrashing. Recent works advocate processing geometry in a "streaming" manner, where computation and output begin as soon as possible. Streaming is suitable for tasks that require only local neighbor information and batch process an entire data set.We describe a streaming compression scheme for tetrahedral volume meshes that encodes vertices and tetrahedra in the order they are written. To keep the memory footprint low, the compressor is informed when vertices are referenced for the last time (i.e. are finalized). The compression achieved depends on how coherent the input order is and how many tetrahedra are buffered for local reordering. For reasonably coherent orderings and a buffer of 10,000 tetrahedra, we achieve compression rates that are only 25 to 40 percent above the state-of-the-art, while requiring drastically less memory resources and less than half the processing time.