Discrete & Computational Geometry

, Volume 21, Issue 4, pp 615–630 | Cite as

Isohedral Polyomino Tiling of the Plane

  • K. Keating
  • A. Vince


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.


Polynomial Time Time Algorithm Polynomial Time Algorithm Euclidean Plane Decidability Question 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag New York Inc. 1999

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