Coverage with k-transmitters in the presence of obstacles

Coverage with k-transmitters in the presence of obstacles

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 suffi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Uehara, R, Souvaine, D, Sacristán Adinolfi, Vera, Morin, P, Lubiw, A, Iacono, J, Ballinger, B, Benbernou, N, Bose, P, Damian, M, Demaine, E. D, Dujmovic, Vida, Flatland, R, Hurtado Díaz, Fernando Alfredo
Format: Text Resource
Sprache:eng
Schlagworte:
Anàlisi combinatòria
Combinatorial analysis
Combinatòria
Convex geometry
Geometria convexa
Matemàtica discreta
Matemàtiques i estadística
Mathematical optimization
Optimització matemàtica
Àrees temàtiques de la UPC
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1007/978-3-642-17461-2