Balanced circle packings for planar graphs
- Author(s): Alam, MJ;
- Eppstein, D;
- Goodrich, MT;
- Kobourov, SG;
- Pupyrev, S
- et al.
Published Web Locationhttps://doi.org/10.1007/978-3-662-45803-7_11
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.