Isohedral Polyomino Tiling of the Plane
- Cite this article as:
- Keating, K. & Vince, A. Discrete Comput Geom (1999) 21: 615. doi:10.1007/PL00009442
- 70 Downloads
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.