Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have the usual regular square or hexagonal pattern. However, for 1495 values of n in the tested range n≤ 5000, specifically, for n = 49, 61, 79, 97, 107, …4999, we prove that the optimum cannot possibly be achieved by such regular arrangements.The evidence suggests that the limiting height-to-width ratio of rectangles containing an optimal hexagonal packing of circles tends to \( 2 - \sqrt 3 \) as n → ∞, if the limit exists.
KeywordsHexagonal Shrinkage Assure Boris
Unable to display preview. Download preview PDF.
- R.L. Graham and B. D. Lubachevsky, Repeated Patterns of Dense Packings of Equal Disks in a Square, Electr. J. Combin. 3(1) (1996),#R16.Google Scholar
- K. J. Nurmela and P. R. J. Östergård, Optimal Packings of Equal Circles in na Square, in: Combinatorics, Graph Theory, and Algorithms,Vol. II, Y. Alavi, D.R. Lick, and Schwenk (eds.), New Issues Press,Kalamazoo 1999Google Scholar
- A. Thue, Über die dichteste Zussamenstellung von kongruenten Kreisen in einer Ebene, Christiania Vid. Selsk. Skr. no. 1 (1910), 3–9.Google Scholar