Opposing Half Guards
arXiv:2207.04474
Abstract
We study the art gallery problem for opposing half guards: guards that can either see to their left or to their right only. We present art gallery theorems, show that the location of half guards in 2-guardable polygons is not restricted to extensions, show that the problem is NP-hard in monotone polygons, and present approximation algorithms for spiral and staircase polygons.
17 pages, 12 figures. A preliminary version was published in the 34th Canadian Conference on Computational Geometry (CCCG 2022)