par Demaine, Erik D. ;Langerman, Stefan
Référence Leibniz international proceedings in informatics, 332, 39
Publication Publié, 2025-06-01
Article révisé par les pairs
Résumé : We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding reflections)? This result improves on the best previous construction which requires five polygons.

Documents en relation

DI-fusion