Modem Illumination of Monotone Polygons

TL;DR

This paper investigates the minimum number of wireless devices, called $k$-modems, needed to illuminate monotone and monotone orthogonal polygons, generalizing classical polygon illumination problems by accounting for signal penetration through walls.

Contribution

It provides tight bounds on the number of $k$-modems required for illuminating monotone and monotone orthogonal polygons, extending classical results to scenarios with signal penetration.

Findings

Every monotone polygon with n vertices can be illuminated with ⌈(n-2)/(2k+3)⌉ $k$-modems.

For monotone orthogonal polygons, bounds depend on k being even or odd, with tight bounds demonstrated.

The paper establishes that these bounds are tight through specific polygon examples.

Abstract

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.