Computational aspects of M. C. Escher's ribbon patterns
From MaRDI portal
Publication:489754
DOI10.1007/s00224-013-9485-9zbMath1303.68089OpenAlexW2024243717MaRDI QIDQ489754
Ellen Gethner, David G. Kirkpatrick, Nicholas J. Pippenger
Publication date: 21 January 2015
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-013-9485-9
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Mathematics and visual arts (00A66)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial enumeration of \(2\times 2\) ribbon patterns
- Escher's combinatorial patterns
- On a tiling scheme from M. C. Escher
- Undecidability and nonperiodicity for tilings of the plane
- Applying Burnside's Lemma to a One-Dimensional Escher Problem
- On cycle bases of a graph
- Notes on a class of tiling problems
- The undecidability of the domino problem
This page was built for publication: Computational aspects of M. C. Escher's ribbon patterns
