SMI 2012: Full Progressive compression of manifold polygon meshes
Computers and Graphics
| Hi-index | 0.01 |
In this paper we present a mesh compression method based ona multiresolution decomposition whose detail coefficients have acompact representation and thus smaller entropy than the originalmesh. Given an arbitrary triangular mesh with an irregular connectivity,we use a hierarchical simplification scheme, which generatesa multiresolution model. By reversing the process we define a hierarchicalprogressive refinement process, where a simple predictionplus a correction is used for inserting vertices to form a finerlevel. We show how the connectivity of an arbitrary triangulationcan be encoded efficiently by a coloring technique, and recoveredincrementally during the progressive reconstruction of the originalmesh.