Displaying similar documents to “Efficient packing of unit squares in a square.”

On-line Packing Squares into n Unit Squares

Janusz Januszewski (2010)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

If n ≥ 3, then any sequence of squares of side lengths not greater than 1 whose total area does not exceed ¼(n+1) can be on-line packed into n unit squares.

Translative packing of a square with sequences of squares

Janusz Januszewski (2010)

Colloquium Mathematicae

Similarity:

Let S be a square and let S' be a square of unit area with a diagonal parallel to a side of S. Any (finite or infinite) sequence of homothetic copies of S whose total area does not exceed 4/9 can be packed translatively into S'.

On-line Covering the Unit Square with Squares

Janusz Januszewski (2009)

Bulletin of the Polish Academy of Sciences. Mathematics

Similarity:

The unit square can be on-line covered with any sequence of squares whose total area is not smaller than 4.

Latin squares of order 10.

McKay, Brendan D., Rogoyski, Eric (1995)

The Electronic Journal of Combinatorics [electronic only]

Similarity: