par Langerman, Stefan 
;Winslow, Andrew
Référence Leibniz international proceedings in informatics, 51, page (50.1-50.15)
Publication Publié, 2016-06
;Winslow, Andrew Référence Leibniz international proceedings in informatics, 51, page (50.1-50.15)
Publication Publié, 2016-06
Article révisé par les pairs
| Résumé : | A plane tiling consisting of congruent copies of a shape is isohedral provided that for any pair of copies, there exists a symmetry of the tiling mapping one copy to the other. We give a O(n log2 n)-time algorithm for deciding if a polyomino with n edges can tile the plane isohedrally. This improves on the O(n18)-time algorithm of Keating and Vince and generalizes recent work by Brlek, Provençal, Fédou, and the second author. |
