arXiv Open Access 2015

An Optimal Algorithm for Tiling the Plane with a Translated Polyomino

Andrew Winslow

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.CG

Penulis (1)

Andrew Winslow

Format Sitasi

APA MLA BibTeX

Winslow, A. (2015). An Optimal Algorithm for Tiling the Plane with a Translated Polyomino. https://arxiv.org/abs/1504.07883

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2015
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓