Tiling with Polyominoes and Combinatorial Group Theory
Journal of Combinatorial Theory Series A
American Mathematical Monthly
Exact sampling with coupled Markov chains and applications to statistical mechanics
Proceedings of the seventh international conference on Random structures and algorithms
On tilings by ribbon tetrominoes
Journal of Combinatorial Theory Series A
An algebraic method to compute a shortest path of local flips between two tilings
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On Aperiodic Sets of Wang Tiles
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Markov chain algorithms for planar lattice structures
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Tilings of rectangles with T-tetrominoes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Tilings with trichromatic colored-edges triangles
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Domino tilings and related models: space of configurations of domains with holes
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Feature-based probabilistic texture blending with feature variations for terrains
Computer Animation and Virtual Worlds
Texture tiling on arbitrary topological surfaces using wang tiles
EGSR'05 Proceedings of the Sixteenth Eurographics conference on Rendering Techniques
Hi-index | 0.00 |
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.