Wang tiles: connectivity when tiling a plane

MaRDI QIDQ6126512zbMATH OpenFDO

Authors

Publication date 9 April 2024

Full work available at URL https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/1561

zbMATH Keywords

complexitytilingWang tiles

Mathematics Subject Classification ID

Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1948487
• scientific article; zbMATH DE number 1101596
• scientific article; zbMATH DE number 2119689
• A linear algorithm for brick Wang tiling
• Hard tiling problems with simple tiles

Cites work

• An aperiodic set of 11 Wang tiles
• Nonemptiness problems of plane square tiling with two colors
• Nonemptiness problems of Wang tiles with three colors
• The undecidability of the domino problem
• Undecidability and nonperiodicity for tilings of the plane

This page was built for publication: Wang tiles: connectivity when tiling a plane

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