Coverage with k-transmitters in the presence of obstacles

Authors:
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;Ryuhei Uehara
Affiliations:
Humboldt State University, Arcata;Massachusetts Institute of Technology, Cambridge;Carleton University, Ottawa, Canada;Villanova University, Villanova;Massachusetts Institute of Technology, Cambridge;Carleton University, Ottawa, Canada;Siena College, Loudonville;Universitat Politècnica de Catalunya, Barcelona, Spain;Polytechnic Institute of New York University, New York;University of Waterloo, Waterloo, Canada;Carleton University, Ottawa, Canada;Universitat Politècnica de Catalunya, Barcelona, Spain;Tufts University, Medford;Japan Advanced Institute of Science and Technology, Ishikawa, Japan
Venue:
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Year:
2010

Citing 9
Cited 3

Computational complexity of art gallery problems

IEEE Transactions on Information Theory
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Guarding rectangular art galleries

Discrete Applied Mathematics
A new proof of the 6 color theorem

Journal of Graph Theory
Guard placement for efficient point-in-polygon proofs

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Further Results on Bar k-Visibility Graphs

SIAM Journal on Discrete Mathematics
Improved Bounds for Wireless Localization

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Intersecting Convex Sets by Rays

Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
Bar k-visibility graphs: bounds on the number of edges, chromatic number, and thickness: bounds on the number of edges, chromatic number, and thickness

GD'05 Proceedings of the 13th international conference on Graph Drawing

On k-convex polygons

Computational Geometry: Theory and Applications
Computational geometry column 52

ACM SIGACT News
Watchman routes for lines and line segments

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.