Work

Planar Maps in 4 bits/edge

Year: 2001

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.math/0104147

Author: Curtis, Fred

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W1646110581

Cites:

Cited by:

Related to: 20