A POLYNOMIAL-TIME ALGORITHM FOR COMPUTING THE RESILIENCE OF ARRANGEMENTS OF RAY SENSORS

DOI10.1142/S0218195914600048zbMath1327.68318MaRDI QIDQ5247063

Boting Yang, Sandra Zilles, David G. Kirkpatrick

Publication date: 22 April 2015

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

zbMATH Keywords

sensor networksbarrier coveragebarrier resilienceray sensors

Mathematics Subject Classification ID

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

Related Items

Extremal problems on ray sensor configurations ⋮ On the barrier graph of an arrangement of ray sensors ⋮ Minimum Cell Connection in Line Segment Arrangements

Cites Work

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