Coverage with k-transmitters in the presence of obstacles
For a fixed integer k≥0, a k-transmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k "walls", represented as line segments in the plane. We develop lower and upper bounds for the number of k-transmitters that are necessary and sufficient to cover a given collection of line segments, polygonal chains and polygons.
|Keywords||Art gallery, Coverage, Guarding, Transmitters, Visibility|
|Journal||Journal of Combinatorial Optimization|
Ballinger, B. (Brad), Benbernou, N. (Nadia), Bose, P, Damian, M. (Mirela), Demaine, E.D. (Erik D.), Dujmović, V, … Uehara, R. (Ryuhei). (2013). Coverage with k-transmitters in the presence of obstacles. Journal of Combinatorial Optimization, 25(2), 208–233. doi:10.1007/s10878-012-9475-x