Repositorio de producción científica de la Universidad de Sevilla

On the barrier-resilience of arrangements of ray-sensors

 

Advanced Search
 
Opened Access On the barrier-resilience of arrangements of ray-sensors
Cites
Show item statistics
Icon
Export to
Author: Kirkpatrick, David
Yang, Boting
Zilles, Sandra
Coordinator/Director: Díaz Báñez, José Miguel
Garijo Royo, Delia
Márquez Pérez, Alberto
Urrutia Galicia, Jorge
Date: 2013
Published in: XV Spanish Meeting on Computational Geometry (2013), p 43-46
Document type: Presentation
Abstract: Given an arrangement A of n sensors and two points s and t in the plane, the barrier resilience of A with respect to s and t is the minimum number of sensors whose removal permits a path from s to t such that the path does not intersect the coverage region of any sensor in A. When the surveillance domain is the entire plane and sensor coverage regions are unit line segments, even with restricted orientations, the problem of determining the barrier resilience is known to be NP-hard. On the other hand, if sensor coverage regions are arbitrary lines, the problem has a trivial linear time solution. In this paper, we give an O(n2m) time algorithm for computing the barrier resilience when each sensor coverage region is an arbitrary ray, where m is the number of sensor intersections.
Size: 830.2Kb
Format: PDF

URI: http://hdl.handle.net/11441/60025

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)