Balanced Circle Packings for Planar Graphs
نویسندگان
چکیده
We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle’s diameter to the smallest circle’s diameter is polynomial in the number of circles. We provide a number of positive and negative results for the existence of such balanced configurations.
منابع مشابه
Circle Packings of Maps - the Euclidean Case
In an earlier work, the author extended the AndreevKoebe-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 necessar...
متن کاملPlanar Lombardi Drawings for Subcubic Graphs
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...
متن کاملPrimal-dual Circle packing of Planar Maps
This work is based on Mohar [1]’s recent algorithm for circle packing for the Euclean case. We implement his polynomial time algorithm for constructing primal-dual circle packings of almost 3-connected planar maps. We have improved Mohar’s algorithm and have been able to get near an order of magnitude speed up for large graphs. We describe our implementation in C/C++ style pseudo-code.
متن کاملRigidity of Infinite (circle) Packings
The nerve of a packing is a graph that encodes its combinatorics. The vertices of the nerve correspond to the packed sets, and an edge occurs between two vertices in the nerve precisely when the corresponding sets of the packing intersect. The nerve of a circle packing and other well-behaved packings, on the sphere or in the plane, is a planar graph. It was an observation of Thurston [Thl, Chap...
متن کاملBoundaries of Planar Graphs, via Circle Packings
We provide a geometric representation of the Poisson and Martin boundaries of a transient, bounded degree triangulation of the plane in terms of its circle packing in the unit disc (this packing is unique up to Möbius transformations). More precisely, we show that any bounded harmonic function on the graph is the harmonic extension of some measurable function on the boundary of the disk, and th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014