Mobile vs. point guards
Combinatorics
2019-11-07 v3 Computational Geometry
Abstract
We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Furthermore, we show that the latter two numbers can be calculated in linear time.
Cite
@article{arxiv.1706.02619,
title = {Mobile vs. point guards},
author = {Ervin Győri and Tamás Róbert Mezei},
journal= {arXiv preprint arXiv:1706.02619},
year = {2019}
}
Comments
This version covers a previously missing case in both Phase 2 & 3