Simplifying surfaces with color and texture using quadric error metrics
Proceedings of the conference on Visualization '98
Geometric compression for interactive transmission
Proceedings of the conference on Visualization '00
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features
VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
A Geometric Approach to 3D Object Comparison
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
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
ACM SIGGRAPH 2007 papers
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Lightweight Web3D modeling by finding and reusing repeated components
Proceedings of the 10th International Conference on Virtual Reality Continuum and Its Applications in Industry
Hi-index | 0.00 |
We propose an efficient compression algorithm for massive models, which consist of a large number of small to medium sized connected components. It is based on efficiently exploiting repetitive patterns in the input model. Compared with [Shikhare et al. 2001], the state-of-the-art work for utilizing repetitive patterns for compressing massive models, our new algorithm is more efficient on detecting repeated components and compressing transformations, so that it achieves a considerably higher compression ratio. By recognizing instances repeating in various scalings, which is missed in [Shikhare et al. 2001], we can reduce 40% of the repetitive patterns on average. By aligning components based on their quadric error metrics, we overcome the limitation of [Shikhare et al. 2001] that may regard two components as instances of the same pattern when they have same vertex position but different connectivity. For transformations of all instances, we give an efficient compression scheme, which can save 40% storage on average in comparison with gzip, the popular compression software used in [Shikhare et al. 2001]. By experiments, our new algorithm can achieve compression ratio at about 4% of the raw data, and gain around 40% over [Shikhare et al. 2001] on average.