Orthogonal Art Galleries with Holes: A Coloring Proof of Aggarwal's Theorem
Keyword(s):
We prove that $\lfloor{n+h\over 4}\rfloor$ vertex guards are always sufficient to see the entire interior of an $n$-vertex orthogonal polygon $P$ with an arbitrary number $h$ of holes provided that there exists a quadrilateralization whose dual graph is a cactus. Our proof is based upon $4$-coloring of a quadrilateralization graph, and it is similar to that of Kahn and others for orthogonal polygons without holes. Consequently, we provide an alternate proof of Aggarwal's theorem asserting that $\lfloor{n+h\over 4}\rfloor$ vertex guards always suffice to cover any $n$-vertex orthogonal polygon with $h \le 2$ holes.
2007 ◽
Vol Vol. 9 no. 1
(Analysis of Algorithms)
◽
Keyword(s):
1998 ◽
Vol 08
(01)
◽
pp. 25-38
◽
2013 ◽
Vol 23
(01)
◽
pp. 65-71
◽
Keyword(s):
2012 ◽
Vol 22
(02)
◽
pp. 103-141
◽
1997 ◽
Vol 07
(05)
◽
pp. 473-484
◽