The Parameterized Complexity of Guarding Almost Convex Polygons

Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov +2

Art Gallery is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P, (possibly infinite) sets G and C of points within P, and an int…