Circle packing in a square explained

Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack unit circles into the smallest possible square. Equivalently, the problem is to arrange points in a unit square aiming to get the greatest minimal separation,, between points.^[1] To convert between these two formulations of the problem, the square side for unit circles will be .

Solutions

Solutions (not necessarily optimal) have been computed for every .^[2] Solutions up to are shown below.The obvious square packing is optimal for 1, 4, 9, 16, 25, and 36 circles (the six smallest square numbers), but ceases to be optimal for larger squares from 49 onwards.

Number of circles	Square side length		Number density	Figure
1	2	∞	0.25
2	2+ \sqrt{ 2 } ≈ 3.414...	\sqrt{ 2 } ≈ 1.414...	0.172...
3	2+ (\sqrt{ 2)/() }+\frac ≈ 3.931...	\sqrt{ 6 } - \sqrt{ 2 } ≈ 1.035...	0.194...
4	4	1	0.25
5	2+2 \sqrt{ 2 } ≈ 4.828...	(\sqrt{ 2)/() } ≈ 0.707...	0.215...
6	2 + (12)/(\sqrt{ 13) } ≈ 5.328...	(\sqrt{ 13)/() } ≈ 0.601...	0.211...
7	4+ \sqrt{ 3 } ≈ 5.732...	4- 2 \sqrt{ 3 } ≈ 0.536...	0.213...
8	2 + \sqrt{ 2 } + \sqrt{ 6 } ≈ 5.863...	(\sqrt{ 6)/() } - \frac ≈ 0.518...	0.233...
9	6	0.5	0.25
10	6.747...	0.421...	0.220...
11	3 + \sqrt{ 2 } + (\sqrt{ 6)/() } + \frac ≈ 7.022...	0.398...	0.223...
12	2 +15 \sqrt{ (2)/(17) } ≈ 7.144...	(\sqrt{ 34)/() } ≈ 0.389...	0.235...
13	7.463...	0.366...	0.233...
14	6 + \sqrt{ 3 } ≈ 7.732...	(8)/(13) - (2 \sqrt{ 3)/() } ≈ 0.349...	0.226...
15	4 + \sqrt{ 2 } + \sqrt{ 6 } ≈ 7.863...	(1)/(2) + (\sqrt{ 2)/() } - \frac ≈ 0.341...	0.243...
16	8	0.333...	0.25
17	8.532...	0.306...	0.234...
18	2 + (24)/(\sqrt{ 13) } ≈ 8.656...	(\sqrt{ 13)/() } ≈ 0.300...	0.240...
19	8.907...	0.290...	0.240...
20	(130)/(17) + (16)/(17) \sqrt{ 2 } ≈ 8.978...	(3)/(8) - (\sqrt{ 2)/() } ≈ 0.287...	0.248...

Circle packing in a rectangle

Dense packings of circles in non-square rectangles have also been the subject of investigations.^{[3] [4]}

See also

• Square packing in a circle

References

1. Book: Croft, Hallard T. . Unsolved Problems in Geometry . Falconer, Kenneth J. . Guy, Richard K. . 1991 . Springer-Verlag . New York . 0-387-97506-3 . 108–110 .
2. Web site: The best known packings of equal circles in a square . Eckard Specht . 20 May 2010 . 25 May 2010.
3. Lubachevsky . Boris D. . Graham . Ronald L. . Minimum perimeter rectangles that enclose congruent non-overlapping circles . Discrete Mathematics . Elsevier BV . 309 . 8 . 2009 . 0012-365X . 10.1016/j.disc.2008.03.017 . 1947–1962. 783236 . free . math/0412443 .
4. Specht . E. . High density packings of equal circles in rectangles with variable aspect ratio . Computers & Operations Research . Elsevier BV . 40 . 1 . 2013 . 0305-0548 . 10.1016/j.cor.2012.05.011 . 58–69.