Planar Maps in 4 bits/edge

Details Planar Maps in 4 bits/edge Planar Maps in 4 bits/edge

2001-04-13

arxiv.org/abs/math/0104147v3

Mathematics

Combinatorics

3 pages. HTML plus 2 PNG images ; Postscript available at http://f2.org/download/maths/pm4.ps ; This revision: added notes on

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Planar Maps in 4 bits/edge does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Planar Maps in 4 bits/edge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Planar Maps in 4 bits/edge will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-203210