25 search results - page 3 / 5 » Guarding galleries and terrains |
WALCOM
2010
IEEE
14 years 2 months ago
2010
IEEE
ICCS
2003
Springer
14 years 23 days 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...
IVC
2000
13 years 7 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...
ALGORITHMICA
2010
13 years 7 months ago
2010
We consider a novel 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 within ...
GIS
2007
ACM
14 years 8 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...