165 search results - page 4 / 33 » The Complexity of Guarding Terrains |
ESA
2008
Springer
14 years 11 months ago
2008
Springer
We prove tight bounds on the complexity of bisectors and Voronoi diagrams on so-called realistic terrains, under the geodesic distance. In particular, if n denotes the number of tr...
IWOCA
2009
Springer
15 years 2 months ago
2009
Springer
APAL
2006
14 years 9 months ago
2006
COMPGEOM
2007
ACM
15 years 1 months ago
2007
ACM
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
The problem of searching a polygonal region for an unpredictably moving intruder by a set of stationary guards, each carrying an orientable laser, is known as the Searchlight Sche...