Planar Maps in 4 bits/edge
Combinatorics
2007-05-23 v3
Abstract
Existing planar map encodings neglect maps with loops. The presented scheme encodes any connected planar map in 4 bits/edge. Encoding and decoding time is O(edges). Implicit face/edge/vertex orderings and canonical encodings are discussed.
Cite
@article{arxiv.math/0104147,
title = {Planar Maps in 4 bits/edge},
author = {Fred Curtis},
journal= {arXiv preprint arXiv:math/0104147},
year = {2007}
}
Comments
3 pages. HTML plus 2 PNG images ; Postscript available at http://f2.org/download/maths/pm4.ps ; This revision: added notes on implicit orderings and canonical encodings