Packing polyominoes clumsily

DOI10.1016/J.COMGEO.2013.08.011MaRDI QIDQ390365zbMATH OpenOpenAlexFDO

Authors Stefan Walzer, Torsten Ueckerdt, Maria Axenovich

Publication date 8 January 2014

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2013.08.011

zbMATH Keywords

densitypackingpolyominoessparseaperiodicclumsy

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)

Recommendations

• Packing rectangles with congruent polyominoes
• Polyominoes which tile rectangles
• Asymptotically optimal box packing theorems
• scientific article; zbMATH DE number 2159270
• scientific article; zbMATH DE number 91040
• Tiling with Squares and Packing Dominos in Polynomial Time
• On the exact complexity of polyomino packing
• On the exact complexity of polyomino packing
• Small polyomino packing

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 687006 (Why is no real title available?)
• An aperiodic set of 13 Wang tiles
• Clumsy packing of dominoes
• Mistilings with dominoes
• Pentaplexity. A class of non-periodic tilings of the plane
• Planar tilings by polyominoes, polyhexes, and polyiamonds
• The undecidability of the domino problem

Cited in

(4)

• Restricted Lego towers
• Clumsy packing of dominoes
• Clumsy packings of graphs
• scientific article; zbMATH DE number 7824069 (Why is no real title available?)

This page was built for publication: Packing polyominoes clumsily

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q390365)