Time Cycle
Epson 3000 ink jet print, Somerset Velvet Enhanced, 14.75 x 14.75, 2001

An elementary theorem in topology states that every topological map (set of adjacent regions) has a corresponding graph (set of connected vertices). While the tiling patterns created with the ignotiles are not strictly defined topological maps, it is possible to derive graphs from them using various "adjacency rules." Time Cycle displays a graph on top of a map. The graph is cyclic (a Hamiltonian cycle). The tiles form a Greco-Latin square with respect to color and texture orientation, and employ a shading rule, too. The the path linking the vertices was used to plot out the order of topics in a presentation for the Intersens conference (Marseille 2000).