Abstract
We study the spaces of rhombus tilings, i.e. the graphs whose vertices are tilings of a fixed zonotope. Two tilings are linked if one can pass from one to the other by a local transformation, called a flip. We first use a decomposition method to encode rhombus tilings and give a useful characterization for a sequence of bits to encode a tiling. We use the previous coding to get a canonical representation of tilings, and two order structures on the space of tilings. In codimension 2 we prove that the two order structures are equal. In larger codimensions we study the lexicographic case, and get an order regularity result.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Chavanon, F., Remila, E. Rhombus Tilings: Decomposition and Space Structure. Discrete Comput Geom 35, 329–358 (2006). https://doi.org/10.1007/s00454-005-1207-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-005-1207-x