Dense Packing of Equal Circles within a Circle
From MaRDI portal
Publication:4051238
DOI10.2307/2689291zbMath0297.52014OpenAlexW4230252110MaRDI QIDQ4051238
Publication date: 1975
Full work available at URL: https://doi.org/10.2307/2689291
Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items (11)
Packing 16, 17 or 18 circles in an equilateral triangle ⋮ An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container ⋮ Dense packings of congruent circles in a circle ⋮ Analytical representation and efficient computation of the effective conductivity of two‐phase composite materials ⋮ Packing disks into disks with optimal worst-case density ⋮ Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5 ⋮ AN APPROXIMATION ALGORITHM FOR LOCATING MAXIMAL DISKS WITHIN CONVEX POLYGONS ⋮ Disk packing for the estimation of the size of a wire bundle ⋮ New heuristics for packing unequal circles into a circular container ⋮ Unnamed Item ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
This page was built for publication: Dense Packing of Equal Circles within a Circle