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

不透明集

Opaque sets

Adrian Dumitrescu, Minghui Jiang, János Pach

摘要:

问题的发现“小”集,满足每一条直线相交一个给定的凸区域是由Mazurkiewicz于1916年。我们称这样的集合为{ \em opaque set}或该区域的{ \em barrier}。考虑了给定凸多边形的最短障碍的计算问题,该凸多边形具有$n$顶点。即使对于最简单的例子,如正方形或等边三角形,目前也没有确切的算法。对于一般的障碍,我们提出了一个近似算法的比例$1/2 + \frac{2 +\sqrt{2}}π=1.5867...$。对于连接的障碍,我们实现了近似比1.5716,而对于单弧障碍,我们实现了近似比$\frac{π+5}{π+2} = 1.5834...$。时间复杂度为O(n)我们还表明,如果障碍被限制到(内部和边界的)输入多边形,那么这个问题承认一个完整的多项式时间的近似方案的连接的情况下和二次精确算法的单弧的情况下。

英文摘要:

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an {\em opaque set} or a {\em barrier} for that region. We consider the problem of computing the shortest barrier for a given convex polygon with $n$ vertices. No exact algorithm is currently known even for the simplest instances such as a square or an equilateral triangle. For general barriers, we present an approximation algorithm with ratio $1/2 + \frac{2 +\sqrt{2}}π=1.5867...$. For connected barriers we achieve the approximation ratio 1.5716, while for single-arc barriers we achieve the approximation ratio $\frac{π+5}{π+2} = 1.5834...$. All three algorithms run in O(n) time. We also show that if the barrier is restricted to the (interior and the boundary of the) input polygon, then the problem admits a fully polynomial-time approximation scheme for the connected case and a quadratic-time exact algorithm for the single-arc case.

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

↑