SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Multiresolution analysis for surfaces of arbitrary topological type
ACM Transactions on Graphics (TOG)
Progressive forest split compression
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive geometry compression
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Hierarchical geometric models for visible surface algorithms
Communications of the ACM
Progressive compression for lossless transmission of triangle meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Compressing polygon mesh geometry with parallelogram prediction
Proceedings of the conference on Visualization '02
IEEE Transactions on Visualization and Computer Graphics
Near-optimal connectivity encoding of 2-manifold polygon meshes
Graphical Models - Special issue: Processing on large polygonal meshes
Truly selective refinement of progressive meshes
GRIN'01 No description on Graphics interface 2001
Optimized Triangle Mesh Compression using Prediction Trees
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
Wavelet-Based Multiresolution Analysis of Irregular Surface Meshes
IEEE Transactions on Visualization and Computer Graphics
Optimized Prediction for Geometry Compression of Triangle Meshes
DCC '05 Proceedings of the Data Compression Conference
Random-Accessible Compressed Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
Random Accessible Mesh Compression Using Mesh Chartification
IEEE Transactions on Visualization and Computer Graphics
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
Succinct representation of triangulations with a boundary
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
SMI 2012: Full Progressive compression of manifold polygon meshes
Computers and Graphics
Dependency-Free Parallel Progressive Meshes
Computer Graphics Forum
SMI 2013: POMAR: Compression of progressive oriented meshes accessible randomly
Computers and Graphics
| Hi-index | 0.00 |
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.