The densest packing of 19 congruent circles in a circle
From MaRDI portal
Publication:1282296
DOI10.1023/A:1005091317243zbMath0927.52024OpenAlexW1549020821MaRDI QIDQ1282296
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
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Oriented matroids in discrete geometry (52C40)
Related Items
An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ The smallest convex \(k\)-gon containing \(n\) congruent disks ⋮ 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 ⋮ Global optimization method for finding dense packings of equal circles in a circle ⋮ Sensor network topology design and analysis for efficient data gathering by a mobile mule ⋮ Unnamed Item ⋮ Phase field approach to optimal packing problems and related Cheeger clusters ⋮ Optimal packings for filled rings of circles. ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ On the relative distances of nine or ten points in the boundary of a plane convex body ⋮ Iterated dynamic thresholding search for packing equal circles into a circular container
