Sear
Circle packing in a
circle
Circle packing in a circle is a two-
dimensional packing problem with the
objective of packing unit circles into the
smallest possible larger circle.
Minimum solutions (if several minimal
solutions have been shown to exist, only
one variant appears in the table):[1]
Number
of
Enclosing circle diameter Density Optimality Diagram
unit
circles
1 1 1.0000 Trivially optimal.
2 2 0.5000 Trivially optimal.
3 ≈ 2.154... 0.6466... Trivially optimal.
4 ≈ 2.414... 0.6864... Trivially optimal.
Trivially optimal.
≈ Also proved optimal
5 0.6854...
by Graham
2.701...
(1968)[2]
6 3 0.6666... Trivially optimal.
Also proved optimal
by Graham
(1968)[2]
7 3 0.7777... Trivially optimal.
Proved optimal by
≈ 3.304...
8 0.7328... Pirl
(1969)[3]
Proved optimal by
9 ≈ 3.613... 0.6895... Pirl
(1969)[3]
Proved optimal by
10 3.813... 0.6878... Pirl
(1969)[3]
Proved optimal by
≈ 3.923...
11 0.7148... Melissen
(1994)[4]
12 4.029... 0.7392... Proved optimal by
Fodor
(2000)[5]
Proved optimal by
13 ≈ 4.236... 0.7245... Fodor
(2003)[6]
Conjectured
14 4.328... 0.7474...
optimal.[7]
Conjectured
15 0.7339...
optimal.[7]
≈ 4.521...
Conjectured
16 4.615... 0.7512...
optimal.[7]
17 4.792... 0.7403... Conjectured
optimal.[7]
Conjectured
18 ≈ 4.863... 0.7611...
optimal.[7]
Proved optimal by
19 ≈ 4.863... 0.8034... Fodor
(1999)[8]
Conjectured
20 5.122... 0.7623...
optimal.[7]
See also
Disk covering problem
References
1. Erich Friedman, Circles in Circles on
Erich's Packing Center
2. R.L. Graham, Sets of points with given
minimum separation (Solution to
Problem El921), Amer. Math. Monthly
75 (1968) 192-193.
3. U. Pirl, Der Mindestabstand von n in
der Einheitskreisscheibe gelegenen
Punkten, Mathematische Nachrichten
40 (1969) 111-124.
4. H. Melissen, Densest packing of
eleven congruent circles in a circle,
Geometriae Dedicata 50 (1994) 15-25.
5. F. Fodor, The Densest Packing of 12
Congruent Circles in a Circle, Beiträge
zur Algebra und Geometrie,
Contributions to Algebra and
Geometry 41 (2000) ?, 401–409.
6. F. Fodor, The Densest Packing of 13
Congruent Circles in a Circle, Beiträge
zur Algebra und Geometrie,
Contributions to Algebra and
Geometry 44 (2003) 2, 431–440.
7. Graham RL, Lubachevsky BD, Nurmela
KJ, Ostergard PRJ. Dense packings of
congruent circles in a circle. Discrete
Math 1998;181:139–154.
8. F. Fodor, The Densest Packing of 19
Congruent Circles in a Circle, Geom.
Dedicata 74 (1999), 139–145.
External links
"The best known packings of equal
circles in a circle (complete up to N =
2600)"
"Online calculator for "How many circles
can you get in order to minimize the
waste?"
Packomania for up to 2600 circles.
This Elementary geometry related article is
a stub. You can help Wikipedia by
expanding it.
Retrieved from
"https://en.wikipedia.org/w/index.php?
title=Circle_packing_in_a_circle&oldid=929509418"
Last edited 14 days ago by Imaginatorium
Content is available under CC BY-SA 3.0 unless
otherwise noted.
