Balanced Circle Packings for Planar Graphs
classification
💻 cs.CG
keywords
circlebalanceddiametergraphsnumberpackingsplanarcircle-contact
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.