Multiresolution Random Accessible Mesh Compression

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.

Receiver-driven view-dependent streaming of progressive mesh

“…These algorithms are not designed for network transmission, but our scheme extended several ideas from Kim et al [8] and applied them in view-dependent streaming.…”

“…The above property is also essential in splitting a progressive mesh in random order, in which the set of neighbors of a vertex during the decoding N ′ may not be N , the set during the encoding. If a cut neighbor with an ID of Id is not in N ′ , then either one of its ancestors or at least one of its descendants must belong to N ′ [8]. In the former case, the ancestor is found and used as the cut neighbor since its ID is the prefix of Id.…”

“…In the latter case, the descendants of the original cut neighbor in N ′ are found since they all have Id as their prefix. Kim et al [8] propose a method to find out the proper one as the cut neighbor and they show that despite using replacement in the vertex splitting, the original mesh can be accurately reconstructed when all the vertex splits are applied.…”

“…Kim and Lee [9] improve this method so that the final mesh can keep the original connectivity. Kim et al [8] propose a better scheme that enables an ordinary progressive mesh to be split in random order. This method is applied in our protocol to reduce the cut neighbor dependency and will be described in further details in Section 4.…”

“…Some related work [8,19] have proposed compression algorithms that allow random splitting of a mesh without sacrificing compression efficiency. These algorithms are not designed for network transmission, but our scheme extended several ideas from Kim et al [8] and applied them in view-dependent streaming.…”