Discrete & Computational Geometry

, Volume 21, Issue 4, pp 615–630

Isohedral Polyomino Tiling of the Plane

  • K. Keating
  • A. Vince

DOI: 10.1007/PL00009442

Cite this article as:
Keating, K. & Vince, A. Discrete Comput Geom (1999) 21: 615. doi:10.1007/PL00009442

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.

Copyright information

© 1998 Springer-Verlag New York Inc.

Authors and Affiliations

  • K. Keating
    • 1
  • A. Vince
    • 1
  1. 1.Department of Mathematics, University of Florida, Gainesville, FL 32611, USA {keating,vince}@math.ufl.eduUS

Personalised recommendations