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 isometric copies of P . The decidability question for general tilings by copies of a single polyomino, or even periodic tilings by copies of a single polyomino, remains open.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received June 23, 1997, and in revised form April 6, 1998.
Rights and permissions
About this article
Cite this article
Keating, K., Vince, A. Isohedral Polyomino Tiling of the Plane . Discrete Comput Geom 21, 615–630 (1999). https://doi.org/10.1007/PL00009442
Issue Date:
DOI: https://doi.org/10.1007/PL00009442