Balanced circle packings for planar graphs

Md Jawaherul Alam; David Eppstein; Michael T. Goodrich; Stephen G. Kobourov; Sergey Pupyrev

doi:10.1007/978-3-662-45803-7_11

Balanced circle packings for planar graphs

Md Jawaherul Alam, David Eppstein, Michael T. Goodrich, Stephen G. Kobourov, Sergey Pupyrev

Computer Science

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

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.

Original language	English (US)
Pages (from-to)	125-136
Number of pages	12
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8871
DOIs	https://doi.org/10.1007/978-3-662-45803-7_11
State	Published - 2014

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-662-45803-7_11

Cite this

Balanced circle packings for planar graphs. / Alam, Md Jawaherul; Eppstein, David; Goodrich, Michael T.; Kobourov, Stephen G.; Pupyrev, Sergey.

In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 8871, 2014, p. 125-136.

Research output: Contribution to journal › Article › peer-review

@article{9197a282c1094a12b555acba1ee5c96c,

title = "Balanced circle packings for planar graphs",

abstract = "We study balanced circle packings and circle-contact representations for planar graphs, where the ratio of the largest circle{\textquoteright}s diameter to the smallest circle{\textquoteright}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.",

author = "Alam, {Md Jawaherul} and David Eppstein and Goodrich, {Michael T.} and Kobourov, {Stephen G.} and Sergey Pupyrev",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2014.",

year = "2014",

doi = "10.1007/978-3-662-45803-7_11",

language = "English (US)",

volume = "8871",

pages = "125--136",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

}

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

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

VL - 8871

SP - 125

EP - 136

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -

Balanced circle packings for planar graphs

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this