Balanced Circle Packings for Planar Graphs
Computational Geometry
2014-08-22 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1408.4902,
title = {Balanced Circle Packings for Planar Graphs},
author = {Md. Jawaherul Alam and David Eppstein and Michael T. Goodrich and Stephen G. Kobourov and Sergey Pupyrev},
journal= {arXiv preprint arXiv:1408.4902},
year = {2014}
}