We prove that n+h 4 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 exis...
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...
Ajay Deshpande, Taejung Kim, Erik D. Demaine, Sanj...
We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key with...
We consider a novel class of art gallery problems inspired by wireless localization. Given a simple polygon P, place and orient guards each of which broadcasts a unique key within ...
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, T...
We show that (A), 14 points on the boundary of a Jordan curve, and (B), 16 points in convex position encircled by a Jordan curve, cannot be shattered by interior visibility domains...