An algorithm for packing squares

DOI10.1006/jcta.1997.2836zbMath0913.05034OpenAlexW1966497983MaRDI QIDQ1268620

Marc M. Paulhus

Publication date: 8 June 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/add3571efaa851918915b5113a8f0b2928fc6f79

zbMATH Keywords

packing squarespacking rectangles

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Related Items

A note on three Moser's problems and two Paulhus' lemmas, 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, Perfectly packing a square by squares of sidelength \(f(n)^{-t}\), A simple method for perfect packing of squares of sidelengths \(n^{-1/2-\epsilon}\), Packing of odd squares revisited, On packing of rectangles in a rectangle, A note on perfect packing of squares and cubes, Tilings, Tilings, Parallel packing squares into a triangle, Perfect packing of \(d\)-cubes, Perfect square packings, Compactness theorems for geometric packings

Cites Work

• Unnamed Item
• Unsolved problems in geometry
• On packing unequal rectangles in the unit square
• Two packing problems
• On packings of squares and rectangles
• On packing unequal squares
• On packing of squares and cubes