To access the full text documents, please follow this link: http://hdl.handle.net/2117/11067

Title:	Coverage with k-transmitters in the presence of obstacles
Author:	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
Other authors:	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II; Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta
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.
Subject(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria -Combinatorial analysis -Mathematical optimization -Convex geometry -Anàlisi combinatòria -Optimització matemàtica -Geometria convexa
Rights:
Document type:	Article - Published version Conference Object
Published by:	Springer Verlag
Share:

Show full item record