arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1410.4099cs.CG
收藏

K-modem照明问题的一个上界

An upper bound on the k-modem illumination problem

Frank Duque, Carlos Hidalgo-Toscano

摘要:

经典的多边形照明问题的变化被引入[Aichholzer et. EuroCG'09]。在该变型中,光源被称为k调制解调器的无线设备代替,其可以穿透固定数量k的“墙”。如果连接多边形内部的点的线段与多边形的至多k条边相交,则该点被k调制解调器“照亮”。很容易构造n个顶点的多边形,其中照亮所有内部点所需的k-调制解调器的数量是Ω(n/k)。然而,没有非平凡的上限是已知的。在本文中,我们证明了所需的k调制解调器的数目照亮任何多边形的n个顶点是最多O(n/k)。对于光照一个正交多边形或一组不相交的正交线段的情况,我们给出了一个更紧的界6 n/k + 1。此外,我们提出了一个O(n log n)的时间算法来实现这个界限。

英文摘要:

A variation on the classical polygon illumination problem was introduced in [Aichholzer et. al. EuroCG'09]. In this variant light sources are replaced by wireless devices called k-modems, which can penetrate a fixed number k, of "walls". A point in the interior of a polygon is "illuminated" by a k-modem if the line segment joining them intersects at most k edges of the polygon. It is easy to construct polygons of n vertices where the number of k-modems required to illuminate all interior points is Omega(n/k). However, no non-trivial upper bound is known. In this paper we prove that the number of k-modems required to illuminate any polygon of n vertices is at most O(n/k). For the cases of illuminating an orthogonal polygon or a set of disjoint orthogonal segments, we give a tighter bound of 6n/k + 1. Moreover, we present an O(n log n) time algorithm to achieve this bound.

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

↑