Balanced circle packings for planar graphs

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

Research output: Contribution to journalArticle

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.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Balanced circle packings for planar graphs'. Together they form a unique fingerprint.

  • Cite this