An algorithm to generate exactly once every tiling with lozenges of a domain
Combinatorics
2009-09-25 v1
Abstract
We first show that the tilings of a general domain form a lattice which we then undertake to decompose and generate without any redundance. To this end, we study extensively the relatively simple case of hexagons and their deformations. We show that general domains can be broken up into hexagon-like parts. Finally we give an algorithm to generate exactly once every element in the lattice of the tilings of a general domain.
Keywords
Cite
@article{arxiv.math/0110237,
title = {An algorithm to generate exactly once every tiling with lozenges of a domain},
author = {Sebastien Desreux},
journal= {arXiv preprint arXiv:math/0110237},
year = {2009}
}
Comments
36 pages, 61 figures. To be published in Theoretical Computer Science (special issue on tilings.)