2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2003
Domino tilings and related models: space of configurations of domains with holes
Sebastien Desreux, Martin Matamala, Ivan Rapaport +1
We first prove that the set of domino tilings of a fixed finite figure is a distributive lattice, even in the case when the figure has holes. We then give a geometrical interpretat…
math.DS2003
An optimal algorithm to generate tilings
Sébastien Desreux, Eric Rémila
This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free r…
math.CO2001★ 2 cited
An algorithm to generate exactly once every tiling with lozenges of a domain
Sebastien Desreux
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 re…