Name
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 I I 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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1111/j.1467-8659.2006.00951.x | COMPUTER GRAPHICS FORUM |
Keywords | Field | DocType |
random access | Compression (physics),Computer science,Coding (social sciences),Theoretical computer science,T-vertices,Decoding methods,Quantization (signal processing) | Journal |
Volume | Issue | ISSN |
25 | 3 | 0167-7055 |
Citations | PageRank | References |
14 | 0.58 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Junho Kim | 1 | 14 | 0.58 |
| Sungyul Choe | 2 | 39 | 2.81 |
| Seungyong Lee | 3 | 2130 | 157.29 |