The densest packing of 19 congruent circles in a circle

DOI10.1023/A:1005091317243MaRDI QIDQ1282296zbMATH OpenOpenAlexFDO

Authors Ferenc Fodor

Publication date 6 December 1999

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005091317243

zbMATH Keywords

densest circle packingdensitydiscpacking

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Oriented matroids in discrete geometry (52C40)

Review text

It is proved that the densest packing of 19 congruent circles in a circle is the easy conjectured one: a circle in the center, six touching it around and twelve still around as vertices of a regular dodecagon. The proof uses a Bateman-Erdős approach (originally designed for finding the Besicovitch number \(\beta_2=19\)) and author's useful geometrical lemma together with the known optimality results for packing 7, 8, 9, and 10 circles.

Recommendations

• The densest packing of 13 congruent circles in a circle
• Densest packings of eleven congruent circles in a circle
• The densest packing of 12 congruent circles in a circle

Cited in

(22)

• Die dichteste Packung von 14 Kreisen in einem Quadrat. (On the densest packing of fourteen circles in a square)
• Densest packings of eleven congruent circles in a circle
• The densest packing of 13 congruent circles in a circle
• The densest packing of 12 congruent circles in a circle
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
• Optimal cover of a disk with three smaller congruent disks
• Sensor network topology design and analysis for efficient data gathering by a mobile mule
• Iterated dynamic thresholding search for packing equal circles into a circular container
• Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
• Phase field approach to optimal packing problems and related Cheeger clusters
• Optimal packings for filled rings of circles.
• The smallest convex k-gon containing n congruent disks
• Packing disks into disks with optimal worst-case density
• Packing, covering and tiling in two-dimensional spaces
• Packing disks into disks with optimal worst-case density
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Global optimization method for finding dense packings of equal circles in a circle
• A filtered beam search based heuristic algorithm for packing unit circles into a circular container
• Worst-case optimal covering of rectangles by disks
• Worst-case optimal covering of triangles by disks
• A heuristic algorithm with multi-scale perturbations for point arrangement and equal circle packing in a convex container
• On the relative distances of nine or ten points in the boundary of a plane convex body

This page was built for publication: The densest packing of 19 congruent circles in a circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1282296)