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

具有正交可见性的保护路径多边形

Guarding Path Polygons with Orthogonal Visibility

Hamid Hoorfar, Alireza Bagheri

摘要:

本文研究了简单正交多边形的最小$ r $ -保护问题。如果最小面积矩形包含$ p $且$ q $位于$ P $内,则内部点$ p $属于正交多边形$ P $从$ r $ -guard $ g $可见。如果多边形$ P $中的一组控球后卫的可见区域的并集等于多边形$ P $,即$ P $中的每个点从$ G $中的至少一个控球后卫可见,则这些控球后卫的集合被命名为后卫集合(如表示为$ G $)。对于一个正交多边形,如果其垂直分解的对偶图是一条路,则称之为路多边形。在本文中,我们发现的问题,找到最小数量的$ r $ -警卫(最小保护集)成为线性时间可解的正交路径多边形。路径多边形可以在每四个方向上具有凹陷边。对于这类正交多边形,Worman和Keil已经考虑了这个问题,他们描述了一个运行在$ O(n^{17} poly\log n) $时间的算法,其中$ n $是输入多边形的大小。对于一般可见的简单多边形,即使多边形是正交的,求其最小保护数的问题也是NP难的。我们的算法是纯几何的,并提出了一种新的策略$ r $ -保护正交多边形和保护可以放置在任何地方的内部和边界的多边形。

英文摘要:

We are interested in the problem of guarding simple orthogonal polygons with the minimum number of $ r $-guards. The interior point $ p $ belongs an orthogonal polygon $ P $ is visible from $ r $-guard $ g $, if the minimum area rectangle contained $ p $ and $ q $ lies within $ P $. A set of point guards in polygon $ P $ is named guard set (as denoted $ G $) if the union of visibility areas of these point guards be equal to polygon $ P $ i.e. every point in $ P $ be visible from at least one point guards in $ G $. For an orthogonal polygon, if dual graph of vertical decomposition is a path, it is named path polygon. In this paper, we show that the problem of finding the minimum number of $ r $-guards (minimum guard set) becomes linear-time solvable in orthogonal path polygons. The path polygon may have dent edges in every four orientations. For this class of orthogonal polygon, the problem has been considered by Worman and Keil who described an algorithm running in $ O(n^{17} poly\log n) $-time where $ n $ is the size of the input polygon. The problem of finding minimum number of guards for simple polygon with general visibility is NP-hard, even if polygon be orthogonal. Our algorithm is purely geometric and presents a new strategy for $ r $-guarding orthogonal polygons and guards can be placed everywhere in the interior and boundary of polygon.

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

↑