Title
Computational Aspects of M.C. Escher's Ribbon Patterns.
Abstract
At the heart of the ideas of the work of Dutch graphic artist M.C. Escher is the idea of automation; we consider a problem that was inspired by some of his earlier and lesser known work. Specifically, a motif fragment is a connected region contained in a closed unit square. Consider a union of motif fragments and call the result an Escher tile T. One can then construct a pattern in the Euclidean plane, as Escher did, with the set of horizontal and vertical unit length translations of T. The resulting pattern gives rise to infinitely many sets of motif fragments (each set may be finite or infinite) that are related visually by way of the interconnections across boundaries of the unit squares that underly the construction; a set of related motif fragments sometimes gives the appearance of a ribbon and thus the resulting pattern in the plane is called a ribbon pattern. Escher's designs gave rise to beautiful artwork and inspired equally aesthetic combinatorial questions as well. In his sketchbooks, Escher coloured the ribbon patterns with pleasing results. Colouring the ribbon patterns led naturally to a question of periodicity: is there a prototile that generates a well-coloured pattern? The current work answers the question in the affirmative by way of tools from graph theory, algorithms, and number theory. We end with tools to help address questions of optimization and a list of open questions.
Year
DOI
Venue
2014
10.1007/s00224-013-9485-9
Theory Comput. Syst.
Keywords
Field
DocType
Escher,Ribbon patterns,Tiling,Geometric structure,Periodicity,Optimization
Graph theory,Ribbon,Discrete mathematics,Escher,Combinatorics,Prototile,Motif (music),Unit square,Euclidean geometry,Number theory,Mathematics
Journal
Volume
Issue
ISSN
54
4
1432-4350
Citations 
PageRank 
References 
0
0.34
5
Authors
3
Name
Order
Citations
PageRank
Ellen Gethner16612.55
David G. Kirkpatrick22394541.05
Nicholas Pippenger31136351.89