Random Accessible Hierarchical Mesh Compression for Interactive Visualization

This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computer graphics forum Ročník 28; číslo 5; s. 1311 - 1318
Hlavní autori:	Courbet, Clement, Hudelot, Celine
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Oxford, UK Blackwell Publishing Ltd 01.07.2009 Wiley
Predmet:	and object representations Computer graphics Computer Science Data compression E.4 [Coding and Information Theory]: Data compaction and compression Graphics Hierarchies I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling-Curve I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling—Curve, surface, solid, and object representations solid Studies surface Visualization
ISSN:	0167-7055, 1467-8659
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	This paper presents a novel algorithm for hierarchical random accessible mesh decompression. Our approach progressively decompresses the requested parts of a mesh without decoding less interesting parts. Previous approaches divided a mesh into independently compressed charts and a base coarse mesh. We propose a novel hierarchical representation of the mesh. We build this representation by using a boundary‐based approach to recursively split the mesh in two parts, under the constraint that any of the two resulting submeshes should be reconstructible independently. In addition to this decomposition technique, we introduce the concepts of opposite vertex and context dependant numbering. This enables us to achieve seemingly better compression ratios than previous work on quad and higher degree polygonal meshes. Our coder uses about 3 bits per polygon for connectivity and 14 bits per vertex for geometry using 12 bits quantification.
Bibliografia:	ark:/67375/WNG-5X708F92-1 istex:4AB5235B5E0B957B97E7F89FEDEA007B65C9B1B1 ArticleID:CGF1508 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
ISSN:	0167-7055 1467-8659
DOI:	10.1111/j.1467-8659.2009.01508.x