Discrete & Computational Geometry

, Volume 23, Issue 4, pp 537–553

On the Structure of Multiple Translational Tilings by Polygonal Regions

  • M. N. Kolountzakis

DOI: 10.1007/s004540010014

Cite this article as:
Kolountzakis, M. Discrete Comput Geom (2000) 23: 537. doi:10.1007/s004540010014


We consider polygons with the following ``pairing property'': for each edge of the polygon there is precisely one other edge parallel to it. We study the problem of when such a polygon K tiles multiply the plane when translated at the locations Λ , where Λ is a multiset in the plane. The pairing property of K makes this question particularly amenable to Fourier analysis. As a first application of our approach we establish a necessary and sufficient condition for K to tile with a given lattice Λ . (This was first found by Bolle for the case of convex polygons—notice that all convex polygons that tile, necessarily have the pairing property and, therefore, our theorems apply to them.) Our main result is a proof that a large class of such polygons tile multiply only quasi-periodically, which for us means that Λ must be a finite union of translated two-dimensional lattices in the plane. For the particular case of convex polygons we show that all convex polygons which are not parallelograms tile multiply only quasi-periodically, if at all.

Copyright information

© 2000 Springer-Verlag New York Inc.

Authors and Affiliations

  • M. N. Kolountzakis
    • 1
  1. 1.Department of Mathematics, University of Crete, Knossos Avenue, 714 09 Iraklio, Greece kolount@math.uch.grGR

Personalised recommendations