Showing cs.CGShow all
3 papers · 1 filter
cs.CG2024
Approximation Algorithms for Anchored Multiwatchman Routes
Joseph S. B. Mitchell, Linh Nguyen
We study some variants of the -\textsc{Watchman Routes} problem, the cooperative version of the classic \textsc{Watchman Routes} problem in a simple polygon. The watchmen may be…
cs.CG2024
Multirobot Watchman Routes in a Simple Polygon
Joseph S. B. Mitchell, Linh Nguyen
The well-known \textsc{Watchman Route} problem seeks a shortest route in a polygonal domain from which every point of the domain can be seen. In this paper, we study the cooperativ…
cs.CG2024
Optimizing Visibility-based Search in Polygonal Domains
Kien C. Huynh, Joseph S. B. Mitchell, Linh Nguyen +1
Given a geometric domain , visibility-based search problems seek routes for one or more mobile agents ("watchmen") to move within in order to be able to see a portion (or al…