2000 character limit reached
Opposing Half Guards (2207.04474v1)
Published 10 Jul 2022 in cs.CG
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.