• Citer

An optimal algorithm for tiling the plane with a translated polyomino

par Winslow, Andrew
Référence Lecture notes in computer science, 9472, page (3-13)
Publication Publié, 2015

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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 regular tilings, and we prove that at most Θ(n) such tilings exist.