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

用非重叠的相同贴纸覆盖多边形形状的污渍

Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers

Google(谷歌);Nippon Hyoron Sha, Co., Ltd.(日本评论社有限公司)

Keigo Oka, Naoki Inaba, Akira Iino

AI总结:

本文研究了在多边形约束下,是否存在无法用非重叠相同贴纸覆盖的污渍形状,并证明了该问题的NP完全性。

摘要:

你在墙上发现了一个污渍,决定用不重叠的相同形状的贴纸来覆盖它。是否存在一种贴纸形状,无法覆盖这个污渍?本文在多边形约束下考虑这个问题,完成了始终可覆盖污渍形状(多边形)的分类。我们为最大始终可覆盖多边形提供了证明,并构建了具体的反例,证明即使在无孔多边形中也存在这种情况。这种分类由此产生了一个算法,用于确定任意给定污渍的始终可覆盖性。我们还证明了确定给定贴纸是否能覆盖给定污渍的问题是NP完全的,尽管不需要精确覆盖。这一结果扩展到一维情况,其中连通性要求被移除。作为问题复杂性的示例,对于特定的六边形(6单元)污渍,我们搜索中找到的最小贴纸,虽然未被证明是最小的,其边界框为325×325。

英文摘要:

You find a stain on the wall and decide to cover it with non-overlapping stickers of a single identical shape (rotation and reflection are allowed). Is it possible to find a sticker shape that fails to cover the stain? In this paper, we consider this problem under polyomino constraints and complete the classification of always-coverable stain shapes (polyominoes). We provide proofs for the maximal always-coverable polyominoes and construct concrete counterexamples for the minimal not always-coverable ones, demonstrating that such cases exist even among hole-free polyominoes. This classification consequently yields an algorithm to determine the always-coverability of any given stain. We also show that the problem of determining whether a given sticker can cover a given stain is $\NP$-complete, even though exact cover is not demanded. This result extends to the 1D case where the connectivity requirement is removed. As an illustration of the problem complexity, for a specific hexomino (6-cell) stain, the smallest sticker found in our search that avoids covering it has, although not proven minimum, a bounding box of $325 \times 325$.

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

↑