Computational aspects of M. C. Escher's ribbon patterns
DOI10.1007/S00224-013-9485-9zbMATH Open1303.68089OpenAlexW2024243717MaRDI QIDQ489754FDOQ489754
Authors: Ellen Gethner, David Kirkpatrick, Nicholas 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
Recommendations
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45) Mathematics and visual arts (00A66) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- The undecidability of the domino problem
- Undecidability and nonperiodicity for tilings of the plane
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notes on a class of tiling problems
- On cycle bases of a graph
- Escher's combinatorial patterns
- On a tiling scheme from M. C. Escher
- Applying Burnside's lemma to a one-dimensional Escher problem
- Counting Escher's \(m\times m\) ribbon patterns
- Title not available (Why is that?)
- Combinatorial enumeration of \(2\times 2\) ribbon patterns
Cited In (5)
This page was built for publication: Computational aspects of M. C. Escher's ribbon patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489754)
