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

相同简单多边形的装箱是NP-困难的

Packing identical simple polygons is NP-hard

Sarah R. Allen, John Iacono

摘要:

给定一个小多边形S,一个大的简单多边形B和一个正整数k,它被证明是NP-难的,以确定是否k个副本的小多边形(允许平移和旋转)可以放置在大多边形没有重叠。以前的NP-硬度结果只在允许大多边形是非简单的情况下才知道。提出了一种新的平面电路SAT约简方法,其中构造了一个小多边形来对整个电路进行编码。

英文摘要:

Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap. Previous NP-hardness results were only known in the case where the big polygon is allowed to be non-simple. A novel reduction from Planar-Circuit-SAT is presented where a small polygon is constructed to encode the entire circuit.

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

↑