摘要: In an earlier work, the author extended Andreev-Koebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual packings of arbitrary (essentially) 3-connected maps was found. this note, additional details concerning surfaces constant curvature 0 (with special emphasis on planar graphs where slightly different treatment is necessary) are presented.