The densest packing of 12 congruent circles in a circle
From MaRDI portal
Publication:1580071
zbMath0974.52015MaRDI QIDQ1580071
Publication date: 13 September 2000
Published in: Beiträge zur Algebra und Geometrie (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/231828
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (9)
An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ Packing disks into disks with optimal worst-case density ⋮ Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus ⋮ Optimal cover of a disk with three smaller congruent disks ⋮ Packing, covering and tiling in two-dimensional spaces ⋮ Unnamed Item ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs ⋮ 10-Gabriel graphs are Hamiltonian
This page was built for publication: The densest packing of 12 congruent circles in a circle
