An O(nlogn)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded

Author: Thiant N.  

Publisher: Elsevier

ISSN: 0304-3975

Source: Theoretical Computer Science, Vol.303, Iss.2, 2003-07, pp. : 353-374

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract