Multiresolution Random Accessible Mesh Compression
Junho Kim Sungyul
Choe Seungyong Lee
Abstract
This paper presents a novel approach for mesh compression, which we call
multiresolution random accessible mesh compression. In contrast to previous
mesh compression techniques, the approach enables us to progressively decompress
an arbitrary portion of a mesh without decoding other non-interesting parts.
This simultaneous support of random accessibility and progressiveness is
accomplished by adapting selective refinement of a multiresolution mesh
to the mesh compression domain. We present a theoretical analysis of our
connectivity coding scheme and provide several experimental results. The
performance of our coder is about 11 bits for connectivity and 21 bits for
geometry with 12-bit quantization, which can be considered reasonably good
under the constraint that no fixed neighborhood information can be used
for coding to support decompression in a random order.
Status
Computer Graphics Forum (Eurographics 2006), vol. 25, no. 3, pp. 323-332, 2006.
Files
Images
|
|
|
|
|
|
|
|
|
|
conventional multiresolution mesh compression
|
multiresolution random accessible mesh compression
|
|
|
|
view-dependent decoding: screen-space images,
view-dependently decoded meshes from other views, and the original
models
|
Links
Postech Computer Graphics Laboratory
