Simple algorithms for searching a polygon with flashlights
From MaRDI portal
Recommendations
Cites work
- An algorithm for searching a polygonal region with a flashlight
- scientific article; zbMATH DE number 1445396 (Why is no real title available?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER
- SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM
- Searching for a Mobile Intruder in a Polygonal Region
- THE TWO GUARDS PROBLEM
Cited in
(10)- A framework for pursuit evasion games in
- An alternative proof for the equivalence of searcher and 2-searcher
- A complete algorithm for searchlight scheduling
- Finding the minimum-distance schedule for a boundary searcher with a flashlight
- CLEARING A POLYGON WITH TWO 1-SEARCHERS
- Searching a Circular Corridor with Two Flashlights
- Searching for a Mobile Intruder in a Polygonal Region
- scientific article; zbMATH DE number 2080272 (Why is no real title available?)
- AN ALGORITHM FOR SEARCHING A POLYGONAL REGION WITH A FLASHLIGHT
- Searching a polygonal region by a group of stationary \(k\)-searchers
This page was built for publication: Simple algorithms for searching a polygon with flashlights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1847385)