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.CG2024
Dispersive Vertex Guarding for Simple and Non-Simple Polygons
Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck +2
We study the Dispersive Art Gallery Problem with vertex guards: Given a polygon , with pairwise geodesic Euclidean vertex distance of at least , and a rational numb…