论文信息 - γ-Soft packings of rectangles

γ-Soft packings of rectangles

Abstract We consider the problem of packing a set of rectangles into a square. The areas of the rectangles are given while their aspect ratios can be chosen from a given interval [ 1 , γ ] . We will show that there is always a feasible solution if the square is at least by a factor ρ γ : = max ⁡ { 4 γ 4 γ − 1 , 2 γ } bigger than the total area of the rectangles. Moreover, we will prove that this bound is tight.

Ulrich Brenner

[1] Janusz Januszewski. Packing Rectangles into the Unit Square , 2000 .

[2] Joseph Y.-T. Leung,et al. Packing Squares into a Square , 1990, J. Parallel Distributed Comput..

[3] Hiroshi Nagamochi. Packing Soft Rectangles , 2006, Int. J. Found. Comput. Sci..

[4] Patrick Gardner,et al. The two sides of a Fourier-Stieltjes transform , 1979 .

[5] A. W. Roscoe,et al. The Decomposition of a Rectangle into Rectangles of Minimal Perimeter , 1988, SIAM J. Comput..

[6] J. Moon,et al. Some packing and covering theorems , 1967 .

[7] Klaus Jansen,et al. Maximizing the Number of Packed Rectangles , 2004, SWAT.

[8] Yves Robert,et al. Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms , 2002, Algorithmica.

[9] Pavel Novotný. On packing of squares into a rectangle , 1996 .

[10] Daniel J. Kleitman,et al. An optimal bound for two dimensional bin packing , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[11] Stefan Hougardy. On packing squares into a rectangle , 2011, Comput. Geom..

[12] Hiroshi Nagamochi,et al. An approximation algorithm for dissecting a rectangle into rectangles with specified areas , 2003, Discret. Appl. Math..