Guarding curvilinear art galleries with vertex or point guards

@article{Karavelas2009GuardingCA,
title={Guarding curvilinear art galleries with vertex or point guards},
author={Menelaos I. Karavelas and Elias P. Tsigaridas},
journal={Comput. Geom.},
year={2009},
volume={42},
pages={522-535}
}

One of the earliest and most well known problems in computational geometry is the so-called art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our main focus is on polygons the edges of which are convex arcs pointing towards the exterior or interior… CONTINUE READING