Planar Maps in 4 bits/edge
Curtis, Fred · arXiv (Cornell University) · 2001
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.