An algorithm for packing squares
From MaRDI portal
Consider the problem of finding the smallest \(\varepsilon\) such that the reciprocal squares with sides of length \(1/i\) (where \(i\) ranges from \(2\) upward) can be packed in a rectangle of area \(\pi^2/6-1 +\varepsilon\). The author shows that \(\varepsilon< 1/1244918662\); he also shows that the odd reciprocal squares can be packed in a rectangle of area \(\pi^2/8- 1+\varepsilon\), where \(\varepsilon< 1/2231168737\). He proves a similar result for packing rectangles in a square of side \(1+\varepsilon\). All the results are constructive.
Recommendations
- An approximation algorithm for square packing.
- scientific article; zbMATH DE number 4091172
- Algorithms for Packing Squares: A Probabilistic Analysis
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Algorithms for packing problems
- On a Square Packing Problem
- A Polynomial Time Approximation Scheme for the Square Packing Problem
- Efficient packing of unit squares in a square
- scientific article; zbMATH DE number 786556
Cites work
Cited in
(26)- Compactness theorems for geometric packings
- A note on three Moser's problems and two Paulhus' lemmas
- Perfect packing of cubes
- Algorithm for the vertex packing problem
- Perfect square packings
- A note on perfect packing of squares and cubes
- Parallel packing squares into a triangle
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- Algorithms for packing problems
- scientific article; zbMATH DE number 5695819 (Why is no real title available?)
- scientific article; zbMATH DE number 1846856 (Why is no real title available?)
- A Square-Packing Problem of Erdoes
- Tilings
- Tilings
- Perfectly packing a cube by cubes of nearly harmonic sidelength
- Packing a triangle by equilateral triangles of harmonic sidelengths
- Packing squares into a rectangle with a relatively small area
- A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\)
- Packing of odd squares revisited
- Perfect packing by convex and concave polygons
- Perfectly packing an equilateral triangle by equilateral triangles of sidelengths \(n^{-1/2-\epsilon }\)
- Packing isosceles right triangles of legs of harmonic lengths
- Filling the plane with squares of harmonic areas
- On packing of rectangles in a rectangle
- Slack-pack algorithm for Meir-Moser packing problem
- Perfect packing of \(d\)-cubes
This page was built for publication: An algorithm for packing squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268620)
