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

画廊问题的一个近似算法

An Approximation Algorithm for the Art Gallery Problem

Édouard Bonnet, Tillmann Miltzow

摘要:

给定$n$顶点上的简单多边形$\mathcal{P}$,如果$x$和$y$之间的线段包含在$\mathcal{P}$中,则称$\mathcal{P}$中的两个点$x,y$彼此可见。控球后卫美术馆问题要求最小集合$S$,使得$\mathcal{P}$中的每个点从$S$中的一个点可见。集合$S$称为防护。在整数坐标系下,通过一个特定的一般位置假设,给出了简单多边形控卫问题的第一个$O(\log \text{OPT})$ -近似算法。该算法结合了Efrat和Har-Peled [Inf. Process. Lett. 2006]和Deshpande et. [WADS 2007]。我们还指出了后者的一个错误。

英文摘要:

Given a simple polygon $\mathcal{P}$ on $n$ vertices, two points $x,y$ in $\mathcal{P}$ are said to be visible to each other if the line segment between $x$ and $y$ is contained in $\mathcal{P}$. The Point Guard Art Gallery problem asks for a minimum set $S$ such that every point in $\mathcal{P}$ is visible from a point in $S$. The set $S$ is referred to as guards. Assuming integer coordinates and a specific general position assumption, we present the first $O(\log \text{OPT})$-approximation algorithm for the point guard problem for simple polygons. This algorithm combines ideas of a paper of Efrat and Har-Peled [Inf. Process. Lett. 2006] and Deshpande et. al. [WADS 2007]. We also point out a mistake in the latter.

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

↑