An Optimal Algorithm for Tiling the Plane with a Translated Polyomino

preprint2015arXivOpen access

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 $Θ(n)$ such tilings exist.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

An Optimal Algorithm for Tiling the Plane with a Translated Polyomino

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0