9 search results - page 1 / 2 » Guarding curvilinear art galleries with vertex or point guar... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
SMA
2008
ACM
13 years 5 months ago
2008
ACM
In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves. We consider two types of guards: edge guards (these...
CCCG
2009
13 years 3 months ago
2009
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...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
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...
COMBINATORICS
2006
13 years 5 months ago
2006
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...