Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion

DOI10.1016/0304-3975(95)00204-9zbMath0887.68111OpenAlexW1525708409MaRDI QIDQ1366534

Jean-Claude Fournier

Publication date: 18 September 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00204-9

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (7)

Fast domino tileability ⋮ Tiling pictures of the plane with dominoes ⋮ An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. ⋮ An algorithm to generate exactly once every tiling with lozenges of a domain. ⋮ A variational principle for domino tilings ⋮ How quickly can we sample a uniform domino tiling of the \(2L\times 2L\) square via Glauber dynamics? ⋮ Groups and tilings

Cites Work

• Unnamed Item
• Unnamed Item
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Conway's Tiling Groups

This page was built for publication: Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion