Abstract.
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.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received February 24, 1999, and in revised form August 26, 1999, and October 9, 1999.
Rights and permissions
About this article
Cite this article
Kolountzakis, M. On the Structure of Multiple Translational Tilings by Polygonal Regions. Discrete Comput Geom 23, 537–553 (2000). https://doi.org/10.1007/s004540010014
Published:
Issue Date:
DOI: https://doi.org/10.1007/s004540010014