On packing squares into a rectangle

DOI10.1016/j.comgeo.2011.05.001zbMath1231.52011OpenAlexW2064729796MaRDI QIDQ634254

Stefan Hougardy

Publication date: 2 August 2011

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.05.001

zbMATH Keywords

packingssquaresrectangle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Erd?s problems and related topics of discrete geometry (52C10)

Related Items (8)

\(\gamma\)-soft packings of rectangles ⋮ Improved Bound for Online Square-into-Square Packing ⋮ Packing squares into a rectangle with a relatively small area ⋮ Rectangle packing with additional restrictions ⋮ A GENERALIZATION OF A THEOREM OF KLEITMAN AND KRIEGER ⋮ Online square-into-square packing ⋮ Guillotine cutting is asymptotically optimal for packing consecutive squares ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• Problems, problems, problems
• Unsolved problems in geometry
• Exhaustive approaches to 2D rectangular perfect packings
• Research Problems in Discrete Geometry
• Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
• Some packing and covering theorems
• On packing of squares and cubes
• Packing Squares in Rectangles I

This page was built for publication: On packing squares into a rectangle