Abstract
Dense packings of n congruent circles in a circle were given by Kravitz in 1967 for n = 2,..., 16. In 1969 Pirl found the optimal packings for n ≤ 10, he also conjectured the dense configurations for 11 ≤ n ≤ 19. In 1994, Melissen provided a proof for n = 11. In this paper we exhibit the densest packing of 19 congruent circles in a circle with the help of a technique developed by Bateman and Erdös.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bateman, P. and Erdös, P.: Geometrical extrema suggested by a lemma of Besicovitch, Amer. Math. Monthly 58 (1951), 3060-314.
Bezdek, A. and Bezdek, K.: Über einige dünnste Kreisüberdeckungen konvexer Bereiche durch endliche Anzahl von kongruenten Kreisen, Beiträge Algebra Geom. 19 (1985), 159-168.
Croft, H. T., Falconer, K. J. and Guy, R. K.: Unsolved Problems in Geometry, Springer-Verlag, New York, Berlin, Heidelberg, 1991.
Fejes Tóth, G.: Packing and covering, Handbook of Discrete and Computational Geometry, CRC Press, Boca Raton, 1997, pp. 19-41.
de Groot, C., Peikert, R. and Würtz, D.: The optimal packing of ten equal circles in a square, ETH Zürich IPS Research Report No. 90-12 (1990).
Kirchner, K. and Wengerodt, G.: Die dichteste Packung von 36 Kreisen in einem Quadrat, Beiträge Algebra Geom. 25 (1987), 147-159.
Kravitz, S.: Packing cylinders into cylindrical containers, Math. Mag. 40 (1967), 65-71.
Melissen, J. B. M.: Densest packings of equal circles in an equilateral triangle, Amer. Math. Monthly 100 (1993), 916-925.
Melissen, J. B. M.: Densest packing of eleven congruent circles in a circle, Geom. Dedicata 50 (1994), 15-25.
Melissen, J. B. M.: Densest packing of six equal circles in a square, Elem. Math. 49 (1994), 27-31.
Melissen, J. B. M.: Optimal packing of eleven equal circles in an equilateral triangle, Acta Math. Hung. 65 (1994).
Melissen, J. B. M. and Schur, P. C.: Packing 16, 17 and 18 circles in an equilateral triangle, Discrete Math. 145 (1995), No. 1–3, 333-342.
Moser, L.: Problem 24 (corrected), Canad. Math. Bull. 3 (1960), 78.
Oler, N.: A finite packing problem, Canad. Math. Bull. 4 (1961), 153-155.
Peikert, R., Würtz, D., Monagan, M. and de Groot, C.: Packing circles in a square: a review and new results, Proceedings of the 15th IFIP Conference on System Modelling and Optimization, 1991, Lecture Notes in Control and Inform. Sci. 180, Springer, New York, pp. 45-54.
Pirl, U.: Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten, Math. Nachr. 40 (1969), 111-124.
Schaer, J., Meir, A.: On a geometric extremum problem, Canad. Math. Bull. 8 (1965), 21-27.
Schaer, J.: The densest packing of 9 circles in a square, Canad. Math. Bull. 8 (1965), 273-277.
Wengerodt, G.: Die dichteste Packung von 16 Kreisen in einem Quadrat, Beiträge Algebra Geom. 16 (1983), 173-190.
Wengerodt, G.: Die dichteste Packung von 14 Kreisen in einem Quadrat, Beiträge Algebra Geom. 25 (1987), 25-46.
Wengerodt, G.: Die dichteste Packung von 25 Kreisen in einem Quadrat, Ann. Univ. Sci. Budapest Rolando Eötvös Sect. Math. 30 (1987), 3-15.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fodor, F. The Densest Packing of 19 Congruent Circles in a Circle. Geometriae Dedicata 74, 139–145 (1999). https://doi.org/10.1023/A:1005091317243
Issue Date:
DOI: https://doi.org/10.1023/A:1005091317243