107 search results - page 1 / 22 » Approximation algorithms for art gallery problems in polygon... |
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
DAM
2010
13 years 8 months ago
2010
CIAC
2003
Springer
14 years 4 months ago
2003
Springer
In the Art Gallery problem, given is a polygonal gallery and the goal is to guard the gallery’s interior or walls with a number of guards that must be placed strategically in the...
WADS
2007
Springer
14 years 5 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...
SMA
2008
ACM
13 years 10 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...