On packing unequal squares
From MaRDI portal
The author improves earlier results (cf. \textit{D. Jennings} [J. Comb. Theory, Ser. A 68, No. 2, 465-469 (1994; Zbl 0808.05033)]) by showing that the squares of side \(1/2,1/3,1/4,\dots\) can be packed into a rectangle of size 31/30 by 629/1000. The excess area in this rectangle is less than 1\%; the question of whether this excess can be made arbitrarily small remains open.
Recommendations
Cited in
(20)- Packing equal squares into a large square
- On packing squares with equal squares
- An algorithm for packing squares
- Compactness theorems for geometric packings
- A note on three Moser's problems and two Paulhus' lemmas
- Perfect packing of cubes
- Perfect square packings
- On packings of squares and rectangles
- A note on perfect packing of squares and cubes
- Guillotine cutting is asymptotically optimal for packing consecutive squares
- Perfectly packing a square by squares of sidelength \(f(n)^{-t}\)
- 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
- Perfect packing of \(d\)-cubes
This page was built for publication: On packing unequal squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924232)
