25 search results - page 1 / 5 » Guarding galleries and terrains |
IPL
2006
13 years 4 months ago
2006
Let P be a polygon with n vertices. We say that two points of P see each other if the line segment connecting them lies inside (the closure of) P. In this paper we present efficie...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...
SMA
2008
ACM
13 years 4 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...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
CORR
2008
Springer
13 years 5 months ago
2008
Springer