Conference Proceedings

An optimal algorithm for tiling the plane with a translated polyomino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9472 3-13
DOI: 10.1007/978-3-662-48971-0_1
10Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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

Cite

CITATION STYLE

APA

Winslow, A. (2015). An optimal algorithm for tiling the plane with a translated polyomino. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9472, pp. 3–13). Springer Verlag. https://doi.org/10.1007/978-3-662-48971-0_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free