Title :
Tiling a polygon with rectangles
Author :
Kenyon, Claire ; Kenyon, Richard
Author_Institution :
LIP ENS-Lyon, France
Abstract :
The authors study the problem of tiling a simple polygon of surface n with rectangles of given types (tiles). They present a linear time algorithm for deciding if a polygon can be tiled with 1 × m and k × 1 tiles (and giving a tiling when it exists), and a quadratic algorithm for the same problem when the tile types are m × k and k × m
Keywords :
computational complexity; computational geometry; geometry; linear time algorithm; polygon; quadratic algorithm; rectangles; tiling; time complexity; Tiles;
Conference_Titel :
Foundations of Computer Science, 1992. Proceedings., 33rd Annual Symposium on
Conference_Location :
Pittsburgh, PA
Print_ISBN :
0-8186-2900-2
DOI :
10.1109/SFCS.1992.267790
