Name
Abstract | ||
|---|---|---|
We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon F as input, produces a tiling of F with translated copies of our rectangles (or indicates that there is no tiling). Moreover, we prove that any pair of tilings can be linked by a sequence of local transformations of tilings, called flips. This study is based on the use of Conway’s tiling groups and extends the results of Kenyon and Kenyon (limited to the case when each rectangle has a side of length 1). |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s00454-005-1173-3 | Discrete and Computational Geometry |
Keywords | DocType | Volume |
Computational Mathematic,Time Algorithm,Local Transformation,Quadratic Time,Integer Dimension | Journal | 34 |
Issue | ISSN | Citations |
2 | 0302-9743 | 6 |
PageRank | References | Authors |
0.51 | 10 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Eric Rémila | 1 | 329 | 45.22 |