Skip to main content
Journal ArticleOPEN ACCESS

Balanced circle packings for planar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8871 125-136
DOI: 10.1007/978-3-662-45803-7_11
7Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Alam, M. J., Eppstein, D., Goodrich, M. T., Kobourov, S. G., & Pupyrev, S. (2014). Balanced circle packings for planar graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8871, 125–136. https://doi.org/10.1007/978-3-662-45803-7_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free