Fast domino tileability
Combinatorics
2016-11-07 v2
Abstract
Domino tileability is a classical problem in Discrete Geometry, famously solved by Thurston for simply connected regions in nearly linear time in the area. In this paper, we improve upon Thurston's height function approach to a nearly linear time in the perimeter.
Keywords
Cite
@article{arxiv.1507.00770,
title = {Fast domino tileability},
author = {Igor Pak and Adam Sheffer and Martin Tassy},
journal= {arXiv preprint arXiv:1507.00770},
year = {2016}
}
Comments
Appeared in Discrete Comput. Geom. 56 (2016), 377-394