The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
Journal of Algorithms
Short encodings of planar graphs and maps
Discrete Applied Mathematics
Arithmetic coding for data compression
Communications of the ACM
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
WRAP&Zip decompression of the connectivity of triangle meshes compressed with edgebreaker
Computational Geometry: Theory and Applications - Special issue on multi-resolution modelling and 3D geometry compression
Face fixer: compressing polygon meshes with properties
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Progressive compression for lossless transmission of triangle meshes
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Edgebreaker: Connectivity Compression for Triangle Meshes
IEEE Transactions on Visualization and Computer Graphics
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
SQUEEZE: Fast and Progressive Decompression of Triangle Meshes
CGI '00 Proceedings of the International Conference on Computer Graphics
Wavelet-Based Progressive Compression Scheme for Triangle Meshes: Wavemesh
IEEE Transactions on Visualization and Computer Graphics
Geometry-guided progressive lossless 3D mesh coding with octree (OT) decomposition
ACM SIGGRAPH 2005 Papers
An Efficient Connectivity Compression for Triangular Meshes
Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science
Early-split coding of triangle mesh connectivity
GI '06 Proceedings of Graphics Interface 2006
Progressive lossless mesh compression via incremental parametric refinement
SGP '09 Proceedings of the Symposium on Geometry Processing
Technologies for 3D mesh compression: A survey
Journal of Visual Communication and Image Representation
LR: compact connectivity representation for triangle meshes
ACM SIGGRAPH 2011 papers
The Visual Computer: International Journal of Computer Graphics - CGI'2011 Conference
Rate-distortion optimization for progressive compression of 3D mesh with color attributes
The Visual Computer: International Journal of Computer Graphics
SMI 2012: Full Progressive compression of manifold polygon meshes
Computers and Graphics
Hi-index | 0.00 |
This paper proposes a novel and efficient algorithm for single-rate compression of triangle meshes. The input mesh is traversed along its greedy Hamiltonian cycle in O(n) time. Based on the Hamiltonian cycle, the mesh connectivity can be encoded by a face label sequence with low entropy containing only four kinds of labels (HETS) and the transmission delay at the decoding end that frequently occurs in the conventional single-rate approaches is obviously reduced. The mesh geometry is compressed with a global coordinate concentration strategy and a novel local parallelogram error prediction scheme. Experiments on realistic 3D models demonstrate the effectiveness of our approach in terms of compression rates and run time performance compared to the leading single-rate and progressive mesh compression methods.