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

有时需要非理性的保护

Irrational Guards are Sometimes Needed

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow

摘要:

画廊问题是计算几何中的一个基本问题。我们的目标是在一个简单的多边形内放置最少数量的警卫,使警卫一起可以看到整个多边形。如果线段$xy$完全包含在多边形中,则我们说在位置$x$处的守卫看到点$y$。尽管对美术馆问题进行了广泛的研究,但它仍然是一个悬而未决的问题,即是否有整数坐标给出的多边形需要在任何最优解中具有无理坐标的守卫位置。我们给出了一个肯定的回答这个问题,通过构造一个单调的多边形与整数坐标,可以由三个警卫,只有当我们允许将警卫点无理坐标。否则,需要四名警卫。通过对这个例子的推广,我们证明了对于每个$n$,都存在一个多边形,该多边形可以由具有无理坐标的$3n$守卫,但如果坐标必须是有理数,则需要$4n$守卫.随后,我们表明,有直线多边形的整数坐标,需要警卫与无理坐标在任何最佳解决方案。

英文摘要:

In this paper we study the art gallery problem, which is one of the fundamental problems in computational geometry. The objective is to place a minimum number of guards inside a simple polygon such that the guards together can see the whole polygon. We say that a guard at position $x$ sees a point $y$ if the line segment $xy$ is fully contained in the polygon. Despite an extensive study of the art gallery problem, it remained an open question whether there are polygons given by integer coordinates that require guard positions with irrational coordinates in any optimal solution. We give a positive answer to this question by constructing a monotone polygon with integer coordinates that can be guarded by three guards only when we allow to place the guards at points with irrational coordinates. Otherwise, four guards are needed. By extending this example, we show that for every $n$, there is polygon which can be guarded by $3n$ guards with irrational coordinates but need $4n$ guards if the coordinates have to be rational. Subsequently, we show that there are rectilinear polygons given by integer coordinates that require guards with irrational coordinates in any optimal solution.

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

↑