par Ballinger, Brad;Benbernou, Nadia;Bose, Prosenjit
;Damian, Mirela;Demaine, Erik D.
;Dujmović, Vida V.;Flatland, Robin R.;Hurtado, Ferran
;Iacono, John
;Lubiw, Anna;Morin, Pat P.;Sacristán, Vera;Souvaine, Diane D.L.;Uehara, Ryuhei
Référence Lecture notes in computer science, 6509, page (1-15)
Publication Publié, 2010
;Damian, Mirela;Demaine, Erik D.
;Dujmović, Vida V.;Flatland, Robin R.;Hurtado, Ferran
;Iacono, John
;Lubiw, Anna;Morin, Pat P.;Sacristán, Vera;Souvaine, Diane D.L.;Uehara, RyuheiRéférence Lecture notes in computer science, 6509, page (1-15)
Publication Publié, 2010
Article révisé par les pairs
| Résumé : | 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. © 2010 Springer-Verlag. |



