Premium
Multiresolution Random Accessible Mesh Compression
Author(s) -
Kim Junho,
Choe Sungyul,
Lee Seungyong
Publication year - 2006
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2006.00951.x
Subject(s) - computer science , t vertices , random access , data compression , decoding methods , algorithm , coding (social sciences) , compression (physics) , theoretical computer science , computer graphics , multiresolution analysis , graphics , laplacian smoothing , mesh generation , computer graphics (images) , wavelet , computer vision , wavelet transform , mathematics , finite element method , discrete wavelet transform , statistics , physics , materials science , composite material , thermodynamics , operating system
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. Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling