An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
type: Item
instance of: scholarly article
title: An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
zbMATH Open document ID: 1053.68068
DOI: 10.1016/S0304-3975(02)00497-8
author: Nicolas Thiant
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 68U10
Mathematics Subject Classification ID: 52C20
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1965378
zbMATH Keywords: tileability
MaRDI profile type: Publication
cites work: Domino tiling in planar graphs with regular and bipartite dual. (Pavage par des dominos dans des graphes planaires de dual régulier et biparti)
cites work: Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
cites work: Tiling pictures of the plane with dominoes
cites work: Conway's Tiling Groups
cites work: Perfect matchings of polyomino graphs
full work available at URL: s0304-3975(02)00497-8
OpenAlex ID: W2000775444
description: scientific article; zbMATH DE number 1965378