Random Accessible Hierarchical Mesh Compression for Interactive Visualization

3D meshes are commonly used to represent virtual surface and volumes. However, their raw data representations take a large amount of space. Hence, 3D mesh compression has been an active research topic since the mid 1990s. In 2005, two very good review articles describing the pioneering works were published. Yet, new technologies have emerged since then. In this article, we summarize the early works and put the focus on these novel approaches. We classify and describe the algorithms, evaluate their performance, and provide synthetic comparisons. We also outline the emerging trends for future research.

show abstract

“…13. Random-accessible hierarchical decompression of a triangle mesh [Courbet and Hudelot 2009]. The target points the requested part of the mesh.…”

Section: Random Accessible Compressionmentioning

confidence: 99%

3D Mesh Compression

Maglo¹,

et al. 2015

View full text Add to dashboard Cite

show abstract

“…However, compressed formats produced through sequential encoding cannot be used for random access mesh traversal, and V alone does not provide constant-time access to neighboring elements. Some formats support local decompression [Yoon and Lindstrom 2007;Courbet and Hudelot 2009], but restrict the access pattern to a hierarchical or contiguous traversal and execute a complex decompression code each time a new portion of the mesh is accessed.…”

Section: Prior Artmentioning

confidence: 99%

Lr

Gurung

Luffel

Lindström

et al. 2011

ACM SIGGRAPH 2011 Papers

View full text Add to dashboard Cite

Figure 1: The ring (black loop) delineates two corridors of triangles. Normal T1 triangles (cream/orange) have one ring edge, dead-end T2 triangles (blue) have two ring edges, and T0 triangles (green) comprising bifurcations have no ring edges. Adjacent T0 (gray/red) and T2 triangles (left) are represented internally as inexpensive T1 triangles (right), thereby significantly reducing storage. Our LR representation supports random access to connectivity, storing on average only 1.08 references or 26.2 bits per triangle. AbstractWe propose LR (Laced Ring)-a simple data structure for representing the connectivity of manifold triangle meshes. LR provides the option to store on average either 1.08 references per triangle or 26.2 bits per triangle. Its construction, from an input mesh that supports constant-time adjacency queries, has linear space and time complexity, and involves ordering most vertices along a nearlyHamiltonian cycle. LR is best suited for applications that process meshes with fixed connectivity, as any changes to the connectivity require the data structure to be rebuilt. We provide an implementation of the set of standard random-access, constant-time operators for traversing a mesh, and show that LR often saves both space and traversal time over competing representations.

show abstract

“…However, their method is not progressive, and therefore, the overall imaging of a mesh would require to fully load into memory. [5] and [2] propose an approach that consists on hierarchical splitting mesh into several fragments and compress each fragment separately. With this, the can decompress fragment separately, without waiting full decoding of entire mesh.…”

Section: IImentioning

confidence: 99%