×

The densest packing of 12 congruent circles in a circle. (English) Zbl 0974.52015

The author solves the problem of finding the densest packing of \(n\) congruent circles in a circle for \(n=12\). The optimal circle packings were known for \(n\leq 11\) and \(n=19\).

MSC:

52C15 Packing and covering in \(2\) dimensions (aspects of discrete geometry)
52A10 Convex sets in \(2\) dimensions (including convex curves)
PDFBibTeX XMLCite
Full Text: EuDML EMIS