A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem

Khaled Elbassioni

Given a polygon $H$ in the plane, the art gallery problem calls for fining the smallest set of points in $H$ from which every other point in $H$ is seen. We give a deterministic al…