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).
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rémila, E. Tiling a Polygon with Two Kinds of Rectangles. Discrete Comput Geom 34, 313–330 (2005). https://doi.org/10.1007/s00454-005-1173-3
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-005-1173-3