Coverage with k-transmitters in the presence of obstacles

Brad Ballinger (), Nadia Benbernou (), Prosenjit Bose (), Mirela Damian (), Erik D. Demaine (), Vida Dujmović (), Robin Flatland (), Ferran Hurtado (), John Iacono (), Anna Lubiw (), Pat Morin (), Vera Sacristán (), Diane Souvaine () and Ryuhei Uehara ()
Additional contact information
Brad Ballinger: Humboldt State University
Nadia Benbernou: Massachusetts Institute of Technology
Prosenjit Bose: Carleton University
Mirela Damian: Villanova University
Erik D. Demaine: Massachusetts Institute of Technology
Vida Dujmović: Carleton University
Robin Flatland: Siena College
Ferran Hurtado: Universitat Politècnica de Catalunya
John Iacono: Polytechnic Institute of New York University
Anna Lubiw: University of Waterloo
Pat Morin: Carleton University
Vera Sacristán: Universitat Politècnica de Catalunya
Diane Souvaine: Tufts University
Ryuhei Uehara: Japan Advanced Institute of Science and Technology

Journal of Combinatorial Optimization, 2013, vol. 25, issue 2, No 4, 208-233

Abstract: Abstract 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: Coverage; Guarding; Transmitters; Art gallery; Visibility (search for similar items in EconPapers)
Date: 2013
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-012-9475-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:25:y:2013:i:2:d:10.1007_s10878-012-9475-x

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-012-9475-x

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().