On packing squares into a rectangle

On packing squares into a rectangle,10.1016/j.comgeo.2011.05.001,Computational Geometry: Theory and Applications,Stefan Hougardy

On packing squares into a rectangle   (Citations: 6)
BibTex | RIS | RefWorks Download
We prove that every set of squares with total area 1 can be packed into a rectangle of area at most 2867/2048=1.399… . This improves on the previous best bound of 1.53. Also, our proof yields a linear time algorithm for finding such a packing.
Journal: Computational Geometry: Theory and Applications - COMGEO , vol. 44, no. 8, pp. 456-463, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: