An addition to art galleries with interior walls (Q5932813): Difference between revisions

An art gallery is formed by a simple polygon. Interior walls are non-intersecting diagonals of this polygon with arbitrarily small doorways. Art galleries with interior walls have been studied by \textit{A. Kündgen} [Discrete Comput. Geom. 22, No. 2, 249-258 (1999; Zbl 0944.52002)], who proved that the minimum number of guards that suffices for all art galleries with \(n\) vertices and \(m\) interior walls is \(\min (\lfloor (2n-3)/3\rfloor ,\lfloor (2m+n)/3\rfloor ,\lfloor (2n+m-2)/4\rfloor)\). His proofs for the first two bounds lead to linear-time guard placement algorithms, while this is not the case for the last bound. In the present paper a short alternative proof for the last bound is presented that also leads to a linear-time guard placement algorithm.