Isohedral polyomino tiling of the plane

Citation
K. Keating et A. Vince, Isohedral polyomino tiling of the plane, DISC COM G, 21(4), 1999, pp. 615-630
Citations number
15
Categorie Soggetti
Engineering Mathematics
Journal title
DISCRETE & COMPUTATIONAL GEOMETRY
ISSN journal
01795376 → ACNP
Volume
21
Issue
4
Year of publication
1999
Pages
615 - 630
Database
ISI
SICI code
0179-5376(199906)21:4<615:IPTOTP>2.0.ZU;2-M
Abstract
A polynomial time algorithm is given for deciding, for a given polyomino P, whether there exists an isohedral tiling of the Euclidean plane by isometr ic copies of P. The decidability question for general tilings by copies of a single polyomino, or even periodic tilings by copies of a single polyomin o, remains open.