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:^[1]

Number of unit circles	Enclosing circle radius	Density	Optimality	Diagram
1	1	1.0000	Trivially optimal.
2	2	0.5000	Trivially optimal.
3	$1+\frac{2}{3} \sqrt{3}$ ≈ 2.154...	0.6466...	Trivially optimal.
4	$1+\sqrt{2}$ ≈ 2.414...	0.6864...	Trivially optimal.
5	$1+\sqrt{2(1+\frac{1}{\sqrt{5}})}$ ≈ 2.701...	0.6854...	Proved optimal by Graham in 1968.[2]
6	3	0.6667...	Proved optimal by Graham in 1968.[2]
7	3	0.7778...	Proved optimal by Graham in 1968.[2]
8	$1+\frac{1}{\sin(\frac{\pi}{7})}$ ≈ 3.304...	0.7328...	Proved optimal by Pirl in 1969.[3]
9	$1+\sqrt{2(2+\sqrt{2})}$ ≈ 3.613...	0.6895...	Proved optimal by Pirl in 1969.[3]
10	3.813...	0.6878...	Proved optimal by Pirl in 1969.[3]
11	$1+\frac{1}{\sin(\frac{\pi}{9})}$ ≈ 3.923...	0.7148...	Proved optimal by Melissen in 1994.[4]
12	4.029...	0.7392...	Proved optimal by Fodor in 2000.[5]
13	$2 + \sqrt{5}$ ≈4.236...	0.7245...	Proved optimal by Fodor in 2003.[6]
14	4.328...	0.7474...	Conjectured optimal.[7]
15	4.521...	0.7339...	Conjectured optimal.[7]
16	4.615...	0.7512...	Conjectured optimal.[7]
17	4.792...	0.7403...	Conjectured optimal.[7]
18	$1+\sqrt{2}+\sqrt{6}$ ≈ 4.863...	0.7611...	Conjectured optimal.[7]
19	$1+\sqrt{2}+\sqrt{6}$ ≈ 4.863...	0.8034...	Proved optimal by Fodor in 1999.[8]
20	5.122...	0.7623...	Conjectured optimal.[7]

References

1. ^ Erich Friedman, Circles in Circles on Erich's Packing Center
2. ^ ^{a b c} R.L. Graham, Sets of points with given minimum separation (Solution to Problem El921), Amer. Math. Monthly 75 (1968) 192-193.
3. ^ ^{a b c} U. Pirl, Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten, Math. Nachr. 40 (1969) 111-124.
4. ^ H. Melissen, Densest packing of eleven congruent circles in a circle, Geom. 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. ^ ^{a b c d e f} 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.

This geometry-related article is a stub. You can help Wikipedia by expanding it.v · Categories: Mathematical problems Geometry stubs Wikimedia Foundation. 2010. Игры ⚽ Поможем написать реферат Circle of the Sun Circle packing in a square Look at other dictionaries: Circle packing in an equilateral triangle — is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and… …   Wikipedia Circle packing in an isosceles right triangle — Circle packing in a right isosceles triangle is a packing problem where the objective is to pack n unit circles into the smallest possible isosceles right triangle. Minimum solutions (lengths shown are length of leg) are shown in the table… …   Wikipedia Circle packing in a square — is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square; or, equivalently, to arrange n points in a unit square for the greatest minimal separation, dn, between points.[1] To… …   Wikipedia Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …   Wikipedia Packing problem — Part of a series on Puzzles …   Wikipedia Circle packing — This article describes the packing of circles on surfaces. For the related article on circle packing with a prescribed intersection graph, please see the circle packing theorem. The most efficient way to pack different sized circles together is… …   Wikipedia Sphere packing — In mathematics, sphere packing problems are problems concerning arrangements of non overlapping identical spheres which fill a space. Usually the space involved is three dimensional Euclidean space. However, sphere packing problems can be… …   Wikipedia List of circle topics — This list of circle topics includes things related to the geometric shape, either abstractly, as in idealizations studied by geometers, or concretely in physical space. It does not include metaphors like inner circle or circular reasoning in… …   Wikipedia Castlerigg stone circle — Location map Cumbria label = lat = 54.60259 long = 3.09749 background = white caption = Location of Castlerigg stone circle in Cumbria at grid reference NY292236 float = right width = 175Castlerigg Stone Circle (alt. Keswick Carles, Carles,… …   Wikipedia Golden Circle (company) — Golden Circle Type Unlisted public company Industry Food and beverage Founded 1946 H …   Wikipedia 18+ © Academic, 2000-2024 Contact us: Technical Support, Advertising Dictionaries export, created on PHP, Joomla, Drupal, WordPress, MODx. Mark and share Search through all dictionaries Translate… Search Internet Share the article and excerpts Direct link … Do a right-click on the link above and select “Copy Link”