An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
Computational Geometry
2015-09-23 v2
Abstract
We give a -time algorithm for determining whether translations of a polyomino with edges can tile the plane. The algorithm is also a -time algorithm for enumerating all such tilings that are also regular, and we prove that at most such tilings exist.
Cite
@article{arxiv.1504.07883,
title = {An Optimal Algorithm for Tiling the Plane with a Translated Polyomino},
author = {Andrew Winslow},
journal= {arXiv preprint arXiv:1504.07883},
year = {2015}
}
Comments
In proceedings of ISAAC 2015