Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Coverage with k-transmitters in the presence of obstacles

Autor
Ballinger, B.; Benbernou, N.; Bose, P.; Damian, M.; Demaine, E.; Dujmovic, V.; Flatland, R.; Hurtado, F.; Iacono, J.; Lubiw, A.; Morin, P.; Sacristán, V.; Souvaine, D.; Uehara, R.
Tipus d'activitat
Article en revista
Revista
Journal of combinatorial optimization
Data de publicació
2013-02
Volum
25
Número
2
Pàgina inicial
208
Pàgina final
233
DOI
https://doi.org/10.1007/s10878-012-9475-x Obrir en finestra nova
Resum
For a fixed integer ka parts per thousand yen0, 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.
Paraules clau
Art gallery, Coverage, Guarding, Transmitters, Visibility
Grup de recerca
CGA -Computational Geometry and Applications
DCG - Discrete and Combinatorial Geometry

Participants

  • Ballinger, Brad  (autor)
  • Benbernou, Nadia  (autor)
  • Bose, Prosenjit  (autor)
  • Damian, Mirela  (autor)
  • Demaine, Erik D.  (autor)
  • Dujmovic, Vida  (autor)
  • Flatland, Robin  (autor)
  • Hurtado Diaz, Fernando Alfredo  (autor)
  • Iacono, John  (autor)
  • Lubiw, Anna  (autor)
  • Morin, Pat  (autor)
  • Sacristán Adinolfi, Vera  (autor)
  • Souvaine, Diane  (autor)
  • Uehara, Ryuhei  (autor)