Advertisement
Published in:
2010 | OriginalPaper | Chapter
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
Published in: Combinatorial Optimization and Applications
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.