Practical Approaches to Partially Guarding a Polyhedral Terrain

We study the problem of placing guard towers on a terrain such that the terrain can be seen from at least one tower. This problem is important in many applications, and has an extensive history in the literature (known as, e.g., multiple observer siting). In this paper, we consider the problem on polyhedral terrains, and we allow the guards to see only a fixed fraction of the terrain, rather than everything. We experimentally evaluate how the number of required guards relates to the fraction of the terrain that can be covered. In addition, we introduce the concept of dominated guards, which can be used to preprocess the potential guard locations and speed up the subsequent computations.

[1]  Peter van Oosterom,et al.  Advances in Spatial Data Handling , 2002, Springer Berlin Heidelberg.

[2]  David R. Maidment,et al.  Watershed delineation with triangle-based terrain models , 1990 .

[3]  Marc J. van Kreveld,et al.  Digital Elevation Models and TIN Algorithms , 1996, Algorithmic Foundations of Geographic Information Systems.

[4]  Young-Hoon Kim,et al.  Exploring multiple viewshed analysis using terrain features and optimisation techniques , 2004, Comput. Geosci..

[5]  Marc van Kreveld,et al.  Algorithmic Foundations of Geographic Information Systems , 1997, Lecture Notes in Computer Science.

[6]  Richard Cole,et al.  Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..

[7]  Noga Alon,et al.  Algorithmic construction of sets for k-restrictions , 2006, TALG.

[8]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[9]  Pin Lv,et al.  An Optimal Method for Multiple Observers Sitting on Terrain Based on Improved Simulated Annealing Techniques , 2006, IEA/AIE.

[10]  Leila De Floriani,et al.  Algorithms for Visibility Computation on Terrains: A Survey , 2003 .

[11]  Micha Sharir,et al.  Efficient Hidden Surface Removal for Objects with Small Union Size , 1992, Comput. Geom..

[12]  Stephan Eidenbenz,et al.  Positioning Guards at Fixed Height Above a Terrain - An Optimum Inapproximability Result , 1998, ESA.

[13]  P. Burrough,et al.  Principles of geographical information systems , 1998 .

[14]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[17]  Salles V. G. Magalhães,et al.  An optimization heuristic for siting observers in huge terrains stored in external memory , 2010, 2010 10th International Conference on Hybrid Intelligent Systems.

[18]  W. R. Franklin.  Siting Observers on Terrain , 2002 .

[19]  A. S. Aspbury,et al.  Long-range visibility of greater sage grouse leks: a GIS-based analysis , 2004, Animal Behaviour.

[20]  James M. Hassett,et al.  A GEOGRAPHIC INFORMATION SYSTEM UTILIZING THE TRIANGULATED IRREGULAR NETWORK AS A BASIS FOR HYDROLOGIC MODELING , 2008 .

[21]  Leila De Floriani,et al.  Line-of-Sight Communication on Terrain Models , 1994, Int. J. Geogr. Inf. Sci..

[22]  Rodrigo I. Silveira.  Optimization of polyhedral terrains , 2005 .

[23]  John Fulcher,et al.  Advances in Applied Artificial Intelligence , 2006 .

[24]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[25]  Maarten Löffler,et al.  Terrain visibility with multiple viewpoints , 2013, ISAAC.

[26]  Teresa Santos,et al.  Forest Fires Prevention in Portugal-Using GIS to Help Improving Early Fire Detection Effectiveness , 2007 .

[27]  Kasturi R. Varadarajan,et al.  Geometric Approximation via Coresets , 2007 .