Minimum perimeter rectangles that enclose congruent non-overlapping circles

DOI10.1016/j.disc.2008.03.017zbMath1185.52015arXivmath/0412443OpenAlexW2119506856MaRDI QIDQ1025447

Boris D. Lubachevsky, Ronald L. Graham

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0412443

zbMATH Keywords

rectangledisk packings

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

High density packings of equal circles in rectangles with variable aspect ratio, A literature review on circle and sphere packing problems: models and methodologies, Cutting circles and polygons from area-minimizing rectangles, Linear models for the approximate solution of the problem of packing equal circles into a given domain

Cites Work

• Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond
• Packing up to 50 equal circles in a square
• More optimal packings of equal circles in a square
• Repeated patterns of dense packings of equal disks in a square
• A Finite Packing Problem
• Asymptotic Behavior of Optimal Circle Packings in a Square
• Global Optimization in Geometry — Circle Packing into the Square
• A Packing Inequality for Compact Convex Subsets of the Plane
• Unnamed Item
• Unnamed Item