The lattice structure of the set of domino tilings of a polygon
From MaRDI portal
Publication:1885926
DOI10.1016/j.tcs.2004.03.020zbMath1068.68157OpenAlexW2074728859MaRDI QIDQ1885926
Publication date: 12 November 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.020
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of tessellation and tiling problems (05B45)
Related Items
Decomposition theorem on matchable distributive lattices ⋮ A note on the structure of spaces of domino tilings ⋮ Distances in Domino Flip Graphs ⋮ Distributive lattices, polyhedra, and generalized flows ⋮ Classes of lattices induced by chip firing (and sandpile) dynamics. ⋮ Enumerating \(k\)-arc-connected orientations ⋮ An optimal algorithm to generate tilings ⋮ Flip distances between graph orientations ⋮ Optimal Partial Tiling of Manhattan Polyominoes ⋮ Distances on Lozenge Tilings
Cites Work