Tiling a Rectangle with Polyominoes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2003

Tiling a Rectangle with Polyominoes


A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the bricks which can be tiled by $E$ are exactly the bricks which can be tiled by $F$. Consequently, if we know the set $F$, then we have an algorithm to decide in polynomial time if a brick is tilable or not by the tiles of $E$.
Fichier principal
Vignette du fichier
dmAB0107.pdf (110.63 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-01183321 , version 1 (12-08-2015)



Olivier Bodini. Tiling a Rectangle with Polyominoes. Discrete Models for Complex Systems, DMCS'03, 2003, Lyon, France. pp.81-88, ⟨10.46298/dmtcs.2313⟩. ⟨hal-01183321⟩
149 View
884 Download



Gmail Facebook X LinkedIn More