Compression of massive models by efficiently exploiting repeated patterns

Authors:
Kangying Cai;Yu Jin;Wencheng Wang;QuQing Chen;Zhibo Chen;Jun Teng
Affiliations:
Thomson C.R. Beijing;Beijing Univ. of Posts and Telecommunications;Chinese Academy of Sciences;Thomson C.R. Beijing;Thomson C.R. Beijing;Thomson C.R. Beijing
Venue:
Proceedings of the 16th ACM Symposium on Virtual Reality Software and Technology
Year:
2009

Citing 5
Cited 0

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
Compression of Large 3D Engineering Models using Automatic Discovery of Repeating Geometric Features

VMV '01 Proceedings of the Vision Modeling and Visualization Conference 2001
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
Technologies for 3D mesh compression: A survey

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new compression algorithm for massive models, which consist of a large number of small to medium sized connected components. It is by efficiently exploiting repetitive patterns in the input model. Compared with the similar work by finding repetitive patterns, our new algorithm is more efficient on detecting repeated components by recognizing instances repeating in various scalings. We also propose an efficient compression scheme for transformation data. As a result, it can achieve a considerably higher compression ratio.