Tiling pictures of the plane with dominoes

DOI10.1016/S0012-365X(96)00179-3zbMath0877.05009OpenAlexW2066227270WikidataQ127333287 ScholiaQ127333287MaRDI QIDQ1356753

Jean-Claude Fournier

Publication date: 20 July 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00179-3

zbMATH Keywords

breadth first searchtiling groupsmatching in bipartite graphstiling by dominoes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Combinatorial aspects of tessellation and tiling problems (05B45) Distributed algorithms (68W15)

Related Items (6)

Tilings on the butterfly lattice ⋮ Tile invariants: New horizons. ⋮ 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. ⋮ Optimal Partial Tiling of Manhattan Polyominoes ⋮ Tiling a Manhattan Polyomino with Bars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved parallel algorithm that computes the BFS numbering of a directed graph
• Tiling polygons with parallelograms
• Tiling figures of the plane with two bars
• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
• Tiling with polyominoes and combinatorial group theory
• Conway's Tiling Groups

This page was built for publication: Tiling pictures of the plane with dominoes