A COMPLETE ALGORITHM FOR SEARCHLIGHT SCHEDULING
From MaRDI portal
Publication:3007726
DOI10.1142/S0218195911003573zbMath1228.65025MaRDI QIDQ3007726
Bullo, Francesco, K. Obermeyer, Anurag Ganguli
Publication date: 17 June 2011
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
numerical examples; motion planning; visibility; computational geometry; pursuit-evasion; exact cell decomposition; searchlight scheduling
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
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