文章基本信息

标题：On Primal-Dual Circle Representations
本地全文：下载
作者：Stefan Felsner ; G{"u}nter Rote
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2018
卷号：69
页码：1-18
DOI：10.4230/OASIcs.SOSA.2019.8
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：Disk packing; planar graphs; contact representation