Fodora w 1999 r.205.122...0.7623...Uważa się za optymalne.
Podobne dane są dostępne na stronie internetowej Packomania w zakresie do 2600 kręgów.
Przypisy 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. 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. F. Fodor, The Densest Packing of 19 Congruent Circles in a Circle, Geom. Dedicata 74 (1999), 139–145. R.L. Graham, Sets of points with given minimum separation (Solution to Problem El921), Amer. Math. Monthly 75 (1968) 192-193. Graham RL, Lubachevsky BD, Nurmela KJ,Ostergard PRJ. Dense packings of congruent circles in a circle. Discrete Math 1998;181:139–154. U. Pirl, Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten, Mathematische Nachrichten 40 (1969) 111-124. H. Melissen, Densest packing of eleven congruent circles in a circle, Geometriae Dedicata 50 (1994) 15-25.
Linki zewnętrzne "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?"
Kategoria:Problemy dotyczące okręgów