An alternative proof of the rectilinear art gallery theorem (Q795339): Difference between revisions

A rectilinear polygon is one whose edges are either horizontal or vertical. A guard is a point g that can see a point x if and only if the segment gx remains within the interior or on the boundary of the polygon. \textit{J. Kahn, M. Klawe} and \textit{D. Kleitman} [SIAM J. Algebraic Discrete Methods 4, 194-206 (1983; Zbl 0533.05021)] proved a theorem on the number of guards that are always sufficient to see the entire interior of a rectilinear polygon of a finite number of vertices. In this paper the author gives an alternate proof of the above mentioned theorem using a rectilinear partitioning instead of a partitioning of the polygon into convex quadrilaterals as used in the above cited proof.