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

单调多项式的现代阐释

Modem Illumination of Monotone Polygons

Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl, Jorge Urrutia, Birgit Vogtenhuber

摘要:

我们研究了一个推广的经典问题的照明多边形。我们不对光源进行建模,而是对无线设备进行建模,该无线设备的无线电信号可以穿透给定数量的$k$墙壁。我们称这些对象为$k$ -调制解调器和研究的最小数量的$k$ -调制解调器足够的,有时是必要的,照亮单调和单调正交多边形。我们表明,每一个单调的多边形与$n$顶点可以照亮$\big\lceil \frac{n-2}{2k+3} \big\rceil$ $k$ -调制解调器。此外,我们展示了单调多边形的例子,需要至少$\lceil \frac {n-2} {2k+3}\rceil$ $k$调制解调器被照亮。对于单调的正交多边形与$n$顶点,我们表明,对于$k=1$和甚至$k$,每个这样的多边形可以照亮与$\big\lceil \frac{n-2}{2k+4} \big\rceil$ $k$ -调制解调器,而对于奇$k\geq3$,$\big\lceil \frac{n-2}{2k+6} \big\rceil$ $k$ -调制解调器总是足够的。此外,通过给出单调正交多边形的相应例子,我们证明了这两个界都是紧的。

英文摘要:

We study a generalization of the classical problem of the illumination of polygons. Instead of modeling a light source we model a wireless device whose radio signal can penetrate a given number $k$ of walls. We call these objects $k$-modems and study the minimum number of $k$-modems sufficient and sometimes necessary to illuminate monotone and monotone orthogonal polygons. We show that every monotone polygon with $n$ vertices can be illuminated with $\big\lceil \frac{n-2}{2k+3} \big\rceil$ $k$-modems. In addition, we exhibit examples of monotone polygons requiring at least $\lceil \frac {n-2} {2k+3}\rceil$ $k$-modems to be illuminated. For monotone orthogonal polygons with $n$ vertices we show that for $k=1$ and for even $k$, every such polygon can be illuminated with $\big\lceil \frac{n-2}{2k+4} \big\rceil$ $k$-modems, while for odd $k\geq3$, $\big\lceil \frac{n-2}{2k+6} \big\rceil$ $k$-modems are always sufficient. Further, by presenting according examples of monotone orthogonal polygons, we show that both bounds are tight.

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

↑