A polynomial-time algorithm for computing the resilience of arrangements of ray sensors

DOI10.1142/S0218195914600048zbMATH Open1327.68318MaRDI QIDQ5247063FDOQ5247063

Authors: Boting Yang, Sandra Zilles, David Kirkpatrick 

Publication date: 22 April 2015

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Recommendations

• Approximating barrier resilience for arrangements of non-identical disk sensors
• Complexity of barrier coverage with relocatable sensors in the plane
• Barrier Coverage with Uniform Radii in 2D
• On the complexity of barrier resilience for fat regions
• Complexity of barrier coverage with relocatable sensors in the plane

zbMATH Keywords

sensor networksbarrier coveragebarrier resilienceray sensors

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An optimal algorithm for intersecting line segments in the plane
• Certifying algorithms
• Ray shooting in polygons using geodesic triangulations

Cited In (5)

• On the complexity of barrier resilience for fat regions and bounded ply
• Extremal problems on ray sensor configurations
• Minimum Cell Connection in Line Segment Arrangements
• Approximating barrier resilience for arrangements of non-identical disk sensors
• On the barrier graph of an arrangement of ray sensors

This page was built for publication: A polynomial-time algorithm for computing the resilience of arrangements of ray sensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5247063)