107 search results - page 2 / 22 » Approximation algorithms for art gallery problems in polygon... |
CORR
2010
Springer
13 years 7 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...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
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...
CCCG
2009
13 years 4 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...
IPL
2006
13 years 6 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...
ALENEX
2007
13 years 8 months ago
2007
We propose heuristics for visibility coverage of a polygon with the fewest point guards. This optimal coverage problem, often called the “art gallery problem”, is known to be ...