TY - JOUR
T1 - Balanced circle packings for planar graphs
AU - Alam, Md Jawaherul
AU - Eppstein, David
AU - Goodrich, Michael T.
AU - Kobourov, Stephen G.
AU - Pupyrev, Sergey
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2014.
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84915817264&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84915817264&partnerID=8YFLogxK
U2 - 10.1007/978-3-662-45803-7_11
DO - 10.1007/978-3-662-45803-7_11
M3 - Article
AN - SCOPUS:84915817264
SN - 0302-9743
VL - 8871
SP - 125
EP - 136
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -