Key points are not available for this paper at this time.
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.
Keeler et al. (1995) studied this question.