We consider the set of all tilings by dominoes (2×1 rectangles) of a surface, possibly with boundary, consisting of unit squares. Convert this set into a graph by joining two tilings by an edge if they differ by a flip, i.e., a 90° rotation of a pair of side-by-side dominoes. We give a criterion to decide if two tilings are in the same connected component, a simple formula for distances, and a method to construct geodesics in this graph. For simply connected surfaces, the graph is connected. By naturally adjoining to this graph higher-dimensional cells, we obtain a CW-complex whose connected components are homotopically equivalent to points or circles. As a consequence, for any region different from a torus or Klein bottle, all geodesics with common endpoints are equivalent in the following sense. Build a graph whose vertices are these geodesics, adjacent if they differ only by the order of two flips on disjoint squares: this graph is connected. © 1995 Springer-Verlag New York Inc.
CITATION STYLE
Saldanha, N. C., Tomei, C., Casarin, M. A., & Romualdo, D. (1995). Spaces of domino tilings. Discrete & Computational Geometry, 14(1), 207–233. https://doi.org/10.1007/BF02570703
Mendeley helps you to discover research relevant for your work.