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

色散艺术馆问题

The Dispersive Art Gallery Problem

Christian Rieck, Christian Scheffer

AI总结:

本文提出了色散艺术馆问题,旨在最大化守卫集合中守卫间的最小距离,并针对多连方块给出了最坏情况最优算法、NP完全性证明及树状多连方块的最优动态规划解。

摘要:

我们引入了源自安全问题的艺术馆问题的一种新变体。在此变体中,我们不关注基数最小的守卫集合,而是关注守卫之间具有最大可能距离的守卫集合。据我们所知,该变体此前未被研究过。我们将其称为色散艺术馆问题(Dispersive Art Gallery Problem)。具体而言,在色散艺术馆问题中,给定一个多边形 $\mathcal{P}$ 和一个实数 $\ell$,并希望判定 $\mathcal{P}$ 是否存在一个守卫集合,使得该集合中每对守卫之间的距离至少为 $\ell$。在本文中,我们针对多连方块(polyominoes)类别研究了该问题的顶点守卫变体。我们考虑了矩形可见性以及 $L_1$-度量下的测地线距离。我们的结果如下。我们给出了一个(简单)薄多连方块,使得任何守卫集合的最小成对距离至多为 $3$。在正面结果方面,我们描述了一种算法,该算法能为简单多连方块计算匹配此上界的守卫集合,即该算法构建了最坏情况下的最优解。我们还研究了计算最大化守卫集合中所有守卫对之间最小距离的守卫集合的计算复杂度。我们证明,判定给定多连方块中是否存在一个守卫集合,使得所有守卫对的最小成对距离至少为 $5$,是 NP 完全的。我们还找到了一种最优动态规划方法,该方法能计算树状多连方块中最大化守卫间最小成对距离的守卫集合,即计算最优解。由于 NP 困难性归约中构建的形状也是薄的(但带有孔洞),该结果补全了薄多连方块的情形。

英文摘要:

We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets with largest possible distances between these guards. To the best of our knowledge, this variant has not been considered before. We call it the Dispersive Art Gallery Problem. In particular, in the dispersive art gallery problem we are given a polygon $\mathcal{P}$ and a real number $\ell$, and want to decide whether $\mathcal{P}$ has a guard set such that every pair of guards in this set is at least a distance of $\ell$ apart. In this paper, we study the vertex guard variant of this problem for the class of polyominoes. We consider rectangular visibility and distances as geodesics in the $L_1$-metric. Our results are as follows. We give a (simple) thin polyomino such that every guard set has minimum pairwise distances of at most $3$. On the positive side, we describe an algorithm that computes guard sets for simple polyominoes that match this upper bound, i.e., the algorithm constructs worst-case optimal solutions. We also study the computational complexity of computing guard sets that maximize the smallest distance between all pairs of guards within the guard sets. We prove that deciding whether there exists a guard set realizing a minimum pairwise distance for all pairs of guards of at least $5$ in a given polyomino is NP-complete. We were also able to find an optimal dynamic programming approach that computes a guard set that maximizes the minimum pairwise distance between guards in tree-shaped polyominoes, i.e., computes optimal solutions. Because the shapes constructed in the NP-hardness reduction are thin as well (but have holes), this result completes the case for thin polyominoes.

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

↑