22 search results - page 1 / 5 » Efficient Packing of Unit Squares in a Square |
COMBINATORICS
2002
13 years 4 months ago
2002
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest i...
ACTA
2005
13 years 5 months ago
2005
In online square packing, squares of different sizes arrive online and need to be packed into unit squares which are called bins. The goal is to minimize the number of bins used. ...
COMPUTING
2006
13 years 5 months ago
2006
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
ORL
2006
13 years 5 months ago
2006
We consider the problem of packing two-dimensional rectangles into the minimum number of unit squares, when 90 rotations are allowed. Our main contribution is a polynomial-time al...
ACTA
2008
13 years 5 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...