Circle Packings of Maps in Polynomial Time

✍ Scribed by Bojan Mohar

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 275 KB
• Volume: 18
• Category: Article
• ISSN: 0195-6698
• DOI: 10.1006/eujc.1996.0135

✦ Synopsis

The Andreev-Koebe-Thurston circle packing theorem is generalized and improved in two ways. First, we obtain simultaneous circle packings of the map and its dual map so that, in the corresponding straight-line representations of the map and the dual, any two edges dual to each other are perpendicular. Necessary and sufficient condition for a map to have such a primal-dual circle packing representation in a surface of constant curvature is that its universal cover is 3-connected (the map has no 'planar' 2-separations). Second, an algorithm is obtained that given a map M and a rational number ε > 0 finds an ε-approximation for the radii and the co-ordinates of the centres for the primal-dual circle packing representation of M. The algorithm is polynomial in |E(M)| and log(1/ε). In particular, for a map without planar 2-separations on an arbitrary surface, we have a polynomial time algorithm for simultaneous geodesic convex representations of the map and its dual, so that only edges dual to each other cross, and the angles at the crossings are arbitrarily close to π/2.