Answers are grounded in this paper and cite their sources.
We discuss space-efficient encoding schemes for planar graphs and maps. Our results improve on the constants of previous schemes and can be achieved with simple encoding algorithms. They are near-optimal in number of bits per edge.
No takes yet. Share an insight, caveat, or question.
Keeler et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: