2014/08/21 by Md. Jawaherul Alam, Alam, Md. Jawaherul, David Eppstein +7
Computer Science · Engineering · #Advanced Graph Theory Research #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #FOS: Computer and information sciences #Structural Analysis and Optimization
paper · pdf · doi:10.48550/arxiv.1408.4902
openalex publication_date 2014/08/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
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.