A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING

DOI10.1142/S0218195911003573zbMath1228.65025OpenAlexW2156056336MaRDI QIDQ3007726

K. Obermeyer, Bullo, Francesco, Anurag Ganguli

Publication date: 17 June 2011

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

Full work available at URL: https://doi.org/10.1142/s0218195911003573

zbMATH Keywords

numerical examplesmotion planningvisibilitycomputational geometrypursuit-evasionexact cell decompositionsearchlight scheduling

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

SEARCHING POLYHEDRA BY ROTATING HALF-PLANES ⋮ Monitoring the plane with rotating radars ⋮ The searchlight problem for road networks

Cites Work

• Unnamed Item
• Searching a polygonal region by a group of stationary \(k\)-searchers
• Simple algorithms for searching a polygon with flashlights
• The Searchlight Scheduling Problem
• Visibility Algorithms in the Plane
• Planning Algorithms
• Searching for mobile intruders in a polygonal region by a group of mobile searchers

This page was built for publication: A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING