SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Optimized geometry compression for real-time rendering
VIS '97 Proceedings of the 8th conference on Visualization '97
Real time compression of triangle mesh connectivity
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Converting sets of polygons to manifold surfaces by cutting and stitching
Proceedings of the conference on Visualization '98
Efficient compression of non-manifold polygonal meshes
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Out-of-core simplification of large polygonal models
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
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
QSplat: a multiresolution point rendering system for large meshes
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Single Resolution Compression of Arbitrary Triangular Meshes with Properties
DCC '99 Proceedings of the Conference on Data Compression
Progressive compression of 3D graphic models
ICMCS '97 Proceedings of the 1997 International Conference on Multimedia Computing and Systems
Out-of-core compression for gigantic polygon meshes
ACM SIGGRAPH 2003 Papers
Optimizing markov models with applications to triangular connectivity coding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Fast reconstruction of Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
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 compression of triangle meshes
SIGGRAPH '05 ACM SIGGRAPH 2005 Sketches
Out-of-Core Remeshing of Large Polygonal Meshes
IEEE Transactions on Visualization and Computer Graphics
Streaming compression of triangle meshes
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Fast reconstruction of Delaunay triangulations
Computational Geometry: Theory and Applications - Special issue: The 11th Candian conference on computational geometry - CCCG 99
Feature sensitive out-of-core chartification of large polygonal meshes
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
Data-Parallel Decompression of Triangle Mesh Topology
Computer Graphics Forum
| Hi-index | 0.00 |
We present an algorithm that uses partitioning and gluing to compress large triangular meshes which are too complex to fit in main memory. The algorithm is based largely on the existing mesh compression algorithms, most of which require an 'in-core' representation of the input mesh. Our solution is to partition the mesh into smaller submeshes and compress these submeshes separately using existing mesh compression techniques. Since a direct partition of the input mesh is out of question, instead, we partition a simplified mesh and use the partition on the simplified model to obtain a partition on the original model. In order to recover the full connectivity, we present a simple scheme for encoding/decoding the resulting boundary structure from the mesh partition. When compressing large models with few singular vertices, a negligible portion of the compressed output is devoted to gluing information. On desktop computers, we have run experiments on models with millions of vertices, which could not be compressed using standard compression software packages, and have observed compression ratios as high as 17 to 1 using our technique.