2000 character limit reached
An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
Published 29 Apr 2015 in cs.CG | (1504.07883v2)
Abstract: We give a $O(n)$-time algorithm for determining whether translations of a polyomino with $n$ edges can tile the plane. The algorithm is also a $O(n)$-time algorithm for enumerating all such tilings that are also regular, and we prove that at most $\Theta(n)$ such tilings exist.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.