Abstract
In an earlier work, the author extended the Andreev-Koebe-Thurston circle packing theorem. Additionally, a polynomial time algorithm for constructing primal-dual circle packings of arbitrary (essentially) 3-connected maps was found. In this note, additional details concerning surfaces of constant curvature 0 (with special emphasis on planar graphs where a slightly different treatment is necessary) are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Rendiconti del Seminario Matematico e Fisico di Milano
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
