Multiresolution Random Accessible Mesh Compression

Simple item page
dc.contributor.authorKim, Junhoen_US
dc.contributor.authorChoe, Sungyulen_US
dc.contributor.authorLee, Seungyongen_US
dc.date.accessioned2015-02-21T14:31:10Z
dc.date.available2015-02-21T14:31:10Z
dc.date.issued2006en_US
dc.description.abstractThis 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 Modelingen_US
dc.description.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume25en_US
dc.identifier.doi10.1111/j.1467-8659.2006.00951.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages323-331en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2006.00951.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleMultiresolution Random Accessible Mesh Compressionen_US
Files
Collections
25-Issue 3