Succinct representation of general unlabeled graphs
Discrete Applied Mathematics
Short encodings of planar graphs and maps
Discrete Applied Mathematics
Real time compression of triangle mesh connectivity
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
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient coding of nontriangular mesh connectivity
Graphical Models
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
SIAM Journal on Computing
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
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Edge-Based Data Structures for Solid Modeling in Curved-Surface Environments
IEEE Computer Graphics and Applications
Optimal coding and sampling of triangulations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
| Hi-index | 0.89 |
In this paper, a simple technique to encode any unlabeled and connected plane graph of E edges in Elog"214 bits is proposed. Both loops and multiple edges are allowed. The encoding process follows a labeling strategy based on a deterministic traversal of the graph. It improves existing methods which achieve shorter bit-length encodings in both time efficiency and simplicity. Besides, it does not impose any restriction on the number of loops and multiple edges that are allowed. Compared to techniques of similar time requirements, it offers a more compact compression solution.