Tiling allowing rotations only

DOI10.1016/S0304-3975(98)00327-2MaRDI QIDQ1292299zbMATH OpenFDO

Authors Ivan Rapaport, Eric Goles

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

rotating boardrotation tiling problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Complexity of tile rotation problems
• Hard tiling problems with simple tiles
• Tiling figures of the plane with two bars
• Tiling the Plane with a Fixed Number of Polyominoes

Cites work

• Complexity of tile rotation problems
• On the solvability of domino snake problems
• The undecidability of the domino problem
• Undecidability and nonperiodicity for tilings of the plane

Cited in

(2)

• Covering by squares
• Eric Goles

This page was built for publication: Tiling allowing rotations only

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292299)