Planar Maps in 4 bits/edge (ResearchIndex)

Planar Maps in 4 bits/edge (Make Corrections)
Fred Curtis

View or download:
f2.org/download/maths/pm4.ps
Cached: PS.gz PS PDF DjVu Image Update Help

From: zip.com.au/~fred/pm4 (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

Presented scheme encodes arbitary connected planar maps
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). (Update)

Active bibliography (related documents): More All
0.0: Triangle Fixer: Edge-based Connectivity Compression - Isenburg (1999) (Correct)
0.0: Face Fixer: Compressing Polygon Meshes with Properties - Isenburg, Snoeyink (2000) (Correct)
0.0: Compressing Polygon Mesh Connectivity with Degree Duality.. - Isenburg (Correct)

Similar documents based on text: More All
0.7: Short Encodings of Planar Graphs and Maps - Keeler, Westbrook (1993) (Correct)
0.3: Bijective census and random generation of Eulerian planar maps.. - Schaeffer (1997) (Correct)
0.3: Bijective Census and Random Generation of - Eulerian Planar Maps (Correct)

BibTeX entry: (Update)

@misc{ curtis-planar,
  author = "Fred Curtis",
  title = "Planar Maps in 4 bits/edge",
  eprint = "math.CO/0104147",
  url = "citeseer.nj.nec.com/530467.html" }

Citations (may not include all citations):
219 Primitives for the Manipulation of General Subdivisions and .. (context) - Guibas, Stolfi - 1985
30 Short Encodings of Planar Graphs and Maps - Keeler, Westbrook - 1995
1 Initial revision giving encoding scheme (context) - Turn, succinct et al. - 2001
http://citeseer.nj.nec.com/chuang98compact.html
http://citeseer.nj.nec.com/keeler95short.html

Online articles have much greater impact More about CiteSeer Add search form to your site Submit documents Feedback