Name
Abstract | ||
|---|---|---|
A polynomial time algorithm is given for deciding, for a given polyomino P, whether there exists an isohedral tiling of the Euclidean plane by isometric copies of P. The decidability question for general tilings by copies of a single polyomino, or even periodic tilings by copies of a single polyomino, remains open. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/PL00009442 | Discrete & Computational Geometry |
Field | DocType | Volume |
Topology,Tetromino,Discrete mathematics,Combinatorics,Existential quantification,Polyomino,Decidability,Euclidean geometry,Time complexity,Periodic graph (geometry),Mathematics | Journal | 21 |
Issue | ISSN | Citations |
4 | 0179-5376 | 8 |
PageRank | References | Authors |
0.96 | 6 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kevin Keating | 1 | 49 | 8.87 |
| Andrew Vince | 2 | 89 | 13.61 |