Fast domino tileability
Igor Pak, Adam Sheffer, Martin Tassy · arXiv (Cornell University) · 2015
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.