Tiling Groups for Wang Tiles

Cristopher Moore, Ivan Rapaport and Eric Rémila

Working Papers from Santa Fe Institute

Abstract: We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles, which are squares with colored boundaries where the colors of shared edges must match. We define a set of tiles as unambiguous if it contains all tiles equivalent to the identity in its tiling group. For all but one set of unambiguous tiles with two colors, we give efficient algorithms that tell whether a given region with colored boundary is tileable, show how to sample random tilings, and how to calculate the number of local moves or "flips" required to transform one tiling into another. We also analyze the lattice structure of the set of tilings, and study several examples with three and four colors as well.

Keywords: Tilings; Wang tiles; lattices; group theory; Markov chains; Monte Carlo algorithms (search for similar items in EconPapers)
Date: 2001-08
References: View complete reference list from CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wop:safiwp:01-08-045

Access Statistics for this paper

More papers in Working Papers from Santa Fe Institute Contact information at EDIRC.
Bibliographic data for series maintained by Thomas Krichel ().