arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1703.02671cs.CG
收藏

对称装配难题很难,超出了几个部分

Symmetric Assembly Puzzles are Hard, Beyond a Few Pieces

Erik D. Demaine, Matias Korman, Jason S. Ku, Joseph S. B. Mitchell, Yota Otachi, André van Renssen, Marcel Roeloffzen, Ryuhei Uehara, Yushi Uno

摘要:

我们研究了对称装配难题的复杂性:给定一组简单的多边形,我们能否平移、旋转并可能翻转它们,使它们的相邻不相交的并集是线对称的?在消极的一面,我们表明,该问题是强NP完全的,即使件都是polyominos。在积极的一面,我们表明,该问题可以解决在多项式时间,如果件的数量是一个固定的常数。

英文摘要:

We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the problem is strongly NP-complete even if the pieces are all polyominos. On the positive side, we show that the problem can be solved in polynomial time if the number of pieces is a fixed constant.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑