Abstract
Suppose P is a symmetric convex polygon in the plane. We give an algorithm, running in polynomial time in the number of sides of the polygon, which decides if P can tile the plane by translations at some level (not necessarily at level one; this is multiple tiling). The main technical contribution is a polynomial time algorithm that selects, if this is possible, for each \(j=1,2,\ldots ,n\) one of two given vectors \(e_j\) or \(\tau _j\) so that the selection spans a discrete additive subgroup.
Similar content being viewed by others
References
U. Bolle, On multiple tiles in \(E^2\), in Intuitive Geometry, K. Böröczky and G. Fejes Tóth, editors, Colloquia Mathematica Societatis János Bolyai, Vol. 63 (1994)
N. Gravin, M.N. Kolountzakis, S. Robins, D. Shiryaev, Structure results for multiple tilings in 3D. Discrete Comput. Geom. 50(4), 1033–1050 (2013)
N. Gravin, S. Robins, D. Shiryaev, Translational tilings by a polytope, with multiplicity. Combinatorica 32(6), 629–649 (2012)
M.N. Kolountzakis, On the structure of multiple translational tilings by polygonal regions. Discrete Comput. Geom. 23(4), 537–553 (2000)
N. Lev, B. Liu, Multi-tiling and equidecomposability of polytopes by lattice translates. Bull. Lond. Math. Soc. 51(6), 1079–1098 (2019)
B. Liu, Periodic structure of translational multi-tilings in the plane, arXiv preprint arXiv:1809.03440 (2018)
J. von zur Gathen, J. Gerhard, Modern Computer Algebra, 3rd edn. (Cambridge University Press, Cambridge, 2013)
Funding
This work was supported by the Hellenic Foundation for Research and Innovation, Project HFRI-FM17-1733 and by Grant No 4725 of the University of Crete.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kolountzakis, M.N. Deciding multiple tiling by polygons in polynomial time. Period Math Hung 83, 32–38 (2021). https://doi.org/10.1007/s10998-020-00361-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10998-020-00361-y