Computational complexity of art gallery problems
IEEE Transactions on Information Theory
Art gallery theorems and algorithms
Art gallery theorems and algorithms
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Computational Geometry: Theory and Applications
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Computing the shortest watchtower of a polyhedral terrain in O(nlogn) time
Computational Geometry: Theory and Applications
Digital Elevation Models and TIN Algorithms
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Proceedings of the 3rd international symposium on Information processing in sensor networks
A constant-factor approximation algorithm for optimal terrain guarding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Finding minimum hidden guard sets in polygons: tight approximability results
Computational Geometry: Theory and Applications
ACM Transactions on Sensor Networks (TOSN)
Guarding galleries and terrains
Information Processing Letters
On reduced time fault tolerant paths for multiple UAVs covering a hostile terrain
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Survey and analysis of multimodal sensor planning and integration for wide area surveillance
ACM Computing Surveys (CSUR)
On fast exploration in 2D and 3D terrains with multiple robots
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Finding minimum hidden guard sets in polygons---tight approximability results
Computational Geometry: Theory and Applications
Note: Approximation algorithms for art gallery problems in polygons
Discrete Applied Mathematics
Approximation algorithms to minimum vertex cover problems on polygons and terrains
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Experimental evaluation of an exact algorithm for the orthogonal art gallery problem
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
Efficient viewshed computation on terrain in external memory
Geoinformatica
Approximation algorithms for art gallery problems in polygons and terrains
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
A 4-approximation algorithm for guarding 1.5-dimensional terrains
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Genetic algorithm and pure random search for exosensor distribution optimisation
International Journal of Bio-Inspired Computation
| Hi-index | 0.91 |
We present approximation algorithms and heuristics for several variations of terrain guarding problems, where we need to guard a terrain in its entirety by a minimum number of guards. Terrain guarding has applications in telecommunications, namely in the setting up of antenna networks for wireless communication. Our approximation algorithms transform the terrain guarding instance into a MINIMUM SET COVER instance, which is then solved by the standard greedy approximation algorithm [J. Comput. System Sci. 9 (1974) 256-278]. The approximation algorithms achieve approximation ratios of O(logn), where n is the number of vertices in the input terrain. We also briefly discuss some heuristic approaches for solving other variations of terrain guarding problems, for which no approximation algorithms are known. These heuristic approaches do not guarantee non-trivial approximation ratios but may still yield good solutions.