Planar Maps in 4 bits/edge
| dc.creator | Curtis, Fred | |
| dc.date | 2001-04-13 | |
| dc.date | 2001-12-22 | |
| dc.date.accessioned | 2026-07-07T04:41:18Z | |
| dc.date.available | 2026-07-07T04:41:18Z | |
| dc.description | 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. | |
| dc.description | 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 | |
| dc.identifier | https://arxiv.org/abs/math/0104147 | |
| dc.identifier | http://arxiv.org/abs/math/0104147 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/61302 | |
| dc.subject | Combinatorics | |
| dc.title | Planar Maps in 4 bits/edge | |
| dc.type | text |