, Volume 21, Issue 4, pp 615-630

Isohedral Polyomino Tiling of the Plane

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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.

Received June 23, 1997, and in revised form April 6, 1998.