2 papers
cs.CG2026
Segment Watchman Routes
Anna Brötzner, Omrit Filtser, Bengt J. Nilsson +2
Motivated by applications for robust guarding, we consider a variant of the multiple-watchmen problem that ensures that every point within a polygon is seen from more than one…
cs.CG2025
Multiple Watchman Routes in Staircase Polygons
Anna Brötzner, Bengt J. Nilsson, Christiane Schmidt
We consider the watchman route problem for multiple watchmen in staircase polygons, which are rectilinear - and -monotone polygons. For two watchmen, we propose an algorithm…