13 search results - page 1 / 3 » An Approximation Scheme for Terrain Guarding |
APPROX
2009
Springer
13 years 11 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...
ICCS
2003
Springer
13 years 9 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...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
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...
VISSYM
2003
13 years 5 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...