Dense Packing of Equal Circles within a Circle

DOI10.2307/2689291MaRDI QIDQ4051238zbMATH OpenOpenAlexFDO

Authors George E. Reis

Publication date 1975

Full work available at URL https://doi.org/10.2307/2689291

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Cited in

(14)

• Dense packings of congruent circles in a circle
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
• Disk packing for the estimation of the size of a wire bundle
• Packing 16, 17 or 18 circles in an equilateral triangle
• New heuristics for packing unequal circles into a circular container
• Packing disks into disks with optimal worst-case density
• An approximation algorithm for locating maximal disks within convex polygons
• Packing disks into disks with optimal worst-case density
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Analytical representation and efficient computation of the effective conductivity of two‐phase composite materials
• Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5
• Worst-case optimal covering of rectangles by disks
• Worst-case optimal covering of triangles by disks
• VOROPACK-D: real-time disk packing algorithm using Voronoi diagram

This page was built for publication: Dense Packing of Equal Circles within a Circle

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