  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.
