We study a generalization of the classical problem of
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 necessary to illuminate monotone
and monotone orthogonal polygons. We show that
every monotone polygon on n vertices can be illuminated
k-modems and exhibit examples of
monotone polygons requiring
monotone orthogonal polygons, we show that every
such polygon on n vertices l can be illuminated with
k-modems and give examples which require
k-modems for k even and
for k odd.
CitacióAICHHOLZER, O. [et al.]. Modem illumination of monotone polygons. A: European Workshop on Computational Geometry. "25th. European Workshop on Computational Geometry". 2009, p. 167-170.