Asymptotically optimal box packing theorems.
Reid, Michael (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Shape tiling.”
Asymptotically optimal box packing theorems.
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'.
Uniqueness and symmetry in problems of optimally dense packings.
Bowen, Lewis, Holton, Charles, Radin, Charles, Sadun, Lorenzo (2005)
Mathematical Physics Electronic Journal [electronic only]
Similarity:
Efficient packing of unit squares in a square.
Kearney, Michael J., Shiu, Peter (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tilings and isoperimetrical shapes I: Square lattice
Sylvain Gravier, Charles Payan (2001)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
Packing unit squares in a rectangle.
Nagamochi, Hiroshi (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Tile-transitive partial tilings of the plane.
Huson, Daniel H. (1993)
Beiträge zur Algebra und Geometrie
Similarity:
Packing unit squares in squares: A survey and new results.
Friedman, Erich (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Monomer-dimer tatami tilings of rectangular regions.
Erickson, Alejandro, Ruskey, Frank, Woodcock, Jennifer, Schurch, Mark (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting fixed-height tatami tilings.
Ruskey, Frank, Woodcock, Jennifer (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
When can you tile a box with translates of two given rectangular bricks?
Bower, Richard J., Michael, T.S. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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.