Two problems about tiling in discrete geometry

MaRDI QIDQ3403761zbMATH OpenFDO

Authors Zhanjun Su, Hongjing Chen, Haixia Gao

Publication date 12 February 2010

zbMATH Keywords

boxbrickperfect matchingpolyominorectangletiling

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Polyominoes (05B50) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Recommendations

• When can you tile a box with translates of two given rectangular bricks?
• scientific article; zbMATH DE number 2046042
• Tiling rectangles with polyominoes
• Filling a box with translates of two bricks
• Tiling with arbitrary tiles

Cited in

(11)

• Asymptotically optimal box packing theorems
• On two questions concerning tilings
• Holey matrimony: marrying two approaches to a tiling problem
• Filling a box with translates of two bricks
• When can you tile a box with translates of two given rectangular bricks?
• Tiling with notched cubes
• Klarner systems and tiling boxes with polyominoes
• A tiling problem and the Frobenius number
• Nonemptiness problems of plane square tiling with two colors
• Tiling Bricks with Bricks
• scientific article; zbMATH DE number 1972781 (Why is no real title available?)

This page was built for publication: Two problems about tiling in discrete geometry

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