Dissection With The Fewest Pieces Is Hard, Even To Approximate

Jeffrey Bosboom,Erik D. Demaine,Martin L. Demaine,Jayson Lynch,Pasin Manurangsi,Mikhail Rudoy,Anak Yodpinyanee

DISCRETE AND COMPUTATIONAL GEOMETRY AND GRAPHS, JCDCGG 2015（2016）

引用 5|浏览55

暂无评分

摘要

We prove that it is NP-hard to dissect one simple orthogonal polygon into another using a given number of pieces, as is approximating the fewest pieces to within a factor of 1 + 1/1080 - epsilon.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要