165 search results - page 1 / 33 » The Complexity of Guarding Terrains |
SODA
2010
ACM
14 years 8 months ago
2010
ACM
ICCS
2003
Springer
14 years 4 months ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
GIS
2007
ACM
14 years 12 months ago
2007
ACM
We present the GeoStar project at RPI, which researches various terrain (i.e., elevation) representations and operations thereon. This work is motivated by the large amounts of hi...
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
IPL
2006
13 years 10 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...