2026-07-22T19:10:18Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10034 2024-03-06T10:30:32Z ddc:004 open_access

On Primal-Dual Circle Representations Felsner, Stefan Rote, Günter Disk packing planar graphs contact representation The Koebe-Andreev-Thurston Circle Packing Theorem states that every triangulated planar graph has a contact representation by circles. The theorem has been generalized in various ways. The most prominent generalization assures the existence of a primal-dual circle representation for every 3-connected planar graph. We present a simple and elegant elementary proof of this result. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Stefan Felsner and Günter Rote 2019 Is Part Of OASIcs, Volume 69, 2nd Symposium on Simplicity in Algorithms (SOSA 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.SOSA.2019.8 urn:nbn:de:0030-drops-100349 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SOSA.2019.8 eng https://creativecommons.org/licenses/by/3.0/legalcode