scientific article; zbMATH DE number 806590

MaRDI QIDQ4850437zbMATH OpenFDO

Authors Jean-Claude Fournier

Publication date 30 May 1996

zbMATH Keywords

dominoesembeddinggridmatchingPRAM modeltiling

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
• An O(n n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
• The Tiling Problem Revisited (Extended Abstract)
• An optimal algorithm for tiling the plane with a translated polyomino
• Tiling with Squares and Packing Dominos in Polynomial Time
• Algorithms and Computation
• scientific article; zbMATH DE number 599152
• scientific article; zbMATH DE number 3909236
• A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
• Domino tilings on planar regions

Cited in

(7)

• A multiparameter analysis of domino tiling with an application to concurrent systems
• Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
• Holey matrimony: marrying two approaches to a tiling problem
• Conformal invariance of domino tiling.
• Drawing graphs on rectangular grids
• Limit shapes and the complex Burgers equation
• Height fluctuations in the honeycomb dimer model

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850437)