Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Approximate algorithms for constrained circular cutting problems
Computers and Operations Research
New Approaches to Circle Packing in a Square: With Program Codes (Springer Optimization and Its Applications)
Cutting circles and polygons from area-minimizing rectangles
Journal of Global Optimization
Strips minimization in two-dimensional cutting stock of circular items
Computers and Operations Research
Computers and Operations Research
| Hi-index | 0.01 |
Arranging a fixed number n of equal non-overlapping circles in a rectangle with variable aspect ratio is a non-standard packing problem. It arises if one has to decide how a certain number of circular items should be packed into a rectangular box when no assumption is made on the shape of the box. How must the box be designed to achieve the maximum packing density? This special problem was investigated by Lubachevsky and Graham in 2003, where they classified record packings for n@?213. However, their work lacks a precise treatment of the closure of observed vacancies as well as any numerical data of the best arrangements found. This article introduces a shorter notation for hexagonal dense packings in rectangular containers. Furthermore, it describes a deterministic procedure for the optimization of packings that differ from usual regular hexagonal patterns by one or more vacancies, without relying on simulation programs. A couple of improvements were found (for n=37, 101, 146, 169) and numerical values are given for all packings in the extended range 1@?n@?500 (except for n=393, 411, 421, 453). Numerical results are also available at www.packomania.com/crc_var/.