SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Time/space tradeoffs for polygon mesh rendering
ACM Transactions on Graphics (TOG)
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Compressing large polygonal models
Proceedings of the conference on Visualization '01
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Universal rendering sequences for transparent vertex caching of progressive meshes
GRIN'01 No description on Graphics interface 2001
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Lossless compression of predicted floating-point geometry
Computer-Aided Design
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Progressive out-of-core compression based on multi-level adaptive octree
Proceedings of the 2006 ACM international conference on Virtual reality continuum and its applications
Streaming compression of tetrahedral volume meshes
GI '06 Proceedings of Graphics Interface 2006
Streaming Simplification of Tetrahedral Meshes
IEEE Transactions on Visualization and Computer Graphics
Fast and Efficient Compression of Floating-Point Data
IEEE Transactions on Visualization and Computer Graphics
A streaming algorithm for surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Out-of-core and compressed level set methods
ACM Transactions on Graphics (TOG)
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
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
Technical Section: CHuMI viewer: Compressive huge mesh interactive viewer
Computers and Graphics
Memory efficient ray tracing with hierarchical mesh quantization
Proceedings of Graphics Interface 2010
Streaming-enabled parallel dataflow architecture for multicore systems
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
SMI 2013: POMAR: Compression of progressive oriented meshes accessible randomly
Computers and Graphics
Hi-index | 0.00 |
Current mesh compression schemes encode triangles and vertices in an order derived from systematically traversing the connectivity graph. These schemes struggle with gigabyte-sized mesh input where the construction and the usage of the data structures that support topological traversal queries become I/O-inefficient and require large amounts of temporary disk space. Furthermore they expect the entire mesh as input. Since meshes cannot be compressed until their generation is complete, they have to be stored at least once in uncompressed form. We radically depart from the traditional approach to mesh compression and propose a scheme that incrementally encodes a mesh in the order it is given to the compressor using only minimal memory resources. This makes the compression process essentially transparent to the user and practically independent of the mesh size. This is especially beneficial for compressing large meshes, where previous approaches spend significant memory, disk, and I/O resources on pre-processing, whereas our scheme starts compressing after receiving the first few triangles.