An algorithm to generate exactly once every tiling with lozenges of a domain.

DOI10.1016/S0304-3975(02)00498-XzbMath1052.68146arXivmath/0110237OpenAlexW2094803787MaRDI QIDQ1401373

Sébastien Desreux

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0110237

zbMATH Keywords

LatticeTilingSeedHexagonLozenge

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

A note on the structure of spaces of domino tilings ⋮ Tilings with trichromatic colored-edges triangles ⋮ Domino tilings and related models: Space of configurations of domains with holes ⋮ An optimal algorithm to generate tilings

Cites Work

• Unnamed Item
• Unnamed Item
• Tiling pictures of the plane with dominoes
• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
• Combinatorics of perfect matchings in plane bipartite graphs and application to tilings.
• Tiling with polyominoes and combinatorial group theory
• Conway's Tiling Groups

This page was built for publication: An algorithm to generate exactly once every tiling with lozenges of a domain.