Terrain Visibility with Multiple Viewpoints

We study the problem of visibility in polyhedral terrains in the presence of multiple viewpoints. We consider a triangulated terrain with m > 1 viewpoints (or guards) located on the terrain surface. A point on the terrain is considered visible if it has an unobstructed line of sight to at least one viewpoint. We study several natural and fundamental visibility structures: (1) the visibility map, which is a partition of the terrain into visible and invisible regions; (2) the colored visibility map, which is a partition of the terrain into regions whose points have exactly the same visible viewpoints; and (3) the Voronoi visibility map, which is a partition of the terrain into regions whose points have the same closest visible viewpoint. We study the complexity of each structure for both 1.5D and 2.5D terrains, and provide efficient algorithms to construct them. Our algorithm for the visibility map in 2.5D terrains improves on the only existing algorithm in this setting. To the best of our knowledge, the other structures have not been studied before.

[1]  Joan Antoni Sellarès,et al.  Good-visibility maps visualization , 2010, The Visual Computer.

[2]  Joseph S. B. Mitchell,et al.  A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding , 2007, SIAM J. Comput..

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

[4]  Matt Gibson,et al.  An Approximation Scheme for Terrain Guarding , 2009, APPROX-RANDOM.

[5]  James King,et al.  Terrain Guarding is NP-Hard , 2011, SIAM J. Comput..

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

[7]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[8]  Bernd Möller,et al.  Changing wind-power landscapes: regional assessment of visual impact on land use and population in Northern Jutland, Denmark , 2006 .

[9]  Prosenjit Bose,et al.  Guarding Polyhedral Terrains , 1997, Comput. Geom..

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

[11]  John H. Reif,et al.  An efficient output-sensitive hidden surface removal algorithm and its parallelization , 1988, SCG '88.

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

[13]  Biswanath Mukherjee,et al.  Wireless sensor network survey , 2008, Comput. Networks.

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