SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Real time compression of triangle mesh connectivity
Proceedings of the 25th 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
Efficient coding of nontriangular mesh connectivity
Graphical Models
Edgebreaker: Connectivity Compression for Triangle Meshes
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
Triangle Strip Compression
An Efficient Connectivity Compression for Triangular Meshes
Proceedings of the Fourth Annual ACIS International Conference on Computer and Information Science
| Hi-index | 0.00 |
In this article, we present an efficient algorithm for encoding the connectivity information of general polygon meshes. The algorithm is a single-resolution lossless compression method for meshes, mainly for non-triangular meshes. In comparison with the excellent algorithms previously proposed for non-triangular meshes, the new method highly improves the compression ratio by using a novel entropy coding method. By the method, Huffman coder is first applied, then a context-based arithmetic coder is employed to encode the Huffman codes.The new method also puts forward a novel mesh traversing method by which the traversal to each polygon face could be in multiple times, though encoding each face is still only once. In this new method, "jump" operations are added to replacing "split" operations commonly used in various existing connectivity compression algorithms. Much of the decoding time and space could be saved by using the new traversing method through taking advantage of a decoding scheme that the operator code could be immediately discarded as soon as it is decoded. Therefore, the decoding method could be well applied to the applications with online transmission and decoding. In another word, our algorithm has an advantage of parallel encoding and decoding. The algorithm is also capable of handling the meshes with holes.