Terrain prickliness: theoretical grounds for low complexity viewsheds

An important task in terrain analysis is computing viewsheds. A viewshed is the union of all the parts of the terrain that are visible from a given viewpoint or set of viewpoints. The complexity of a viewshed can vary significantly depending on the terrain topography and the viewpoint position. In this work we study a new topographic attribute, the prickliness, that measures the number of local maxima in a terrain from all possible angles of view. We show that the prickliness effectively captures the potential of terrains to have high complexity viewsheds. We present near-optimal algorithms to compute it for TIN terrains, and efficient approximate algorithms for raster DEMs. We validate the usefulness of the prickliness attribute with experiments in a large set of real terrains. 2012 ACM Subject Classification Theory of computation → Theory and algorithms for application domains

[1]  D. Montgomery,et al.  Digital elevation model grid size, landscape representation, and hydrologic simulations , 1994 .

[2]  Micha Sharir,et al.  Efficient hidden surface removal for objects with small union size , 1991, SCG '91.

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

[4]  Michael T. Goodrich.  A polygonal approach to hidden-line and hidden-surface elimination , 1992, CVGIP Graph. Model. Image Process..

[5]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

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

[7]  W. Randolph,et al.  MULTIPLE OBSERVER SITING ON TERRAIN WITH INTERVISIBILITY OR LO-RES DATA , 2004 .

[8]  Leonidas J. Guibas,et al.  Topologically sweeping an arrangement , 1986, STOC '86.

[9]  Marc J. van Kreveld,et al.  On realistic terrains , 2006, SCG '06.

[10]  Denis J. Dean,et al.  An Investigation into the Causes of Errors and Inconsistencies in Predicted Viewsheds , 2007, Trans. GIS.

[11]  Beniamino Murgante,et al.  Identifying Viewshed: New Approaches to Visual Impact Assessment , 2011 .

[12]  Mark de Berg,et al.  Visibility maps of realistic terrains have linear smoothed complexity , 2009, SCG '09.

[13]  Andrew Chi-Chih Yao.  Lower bounds for algebraic computation trees with integer inputs , 1989, 30th Annual Symposium on Foundations of Computer Science.

[14]  Denis J. Dean.  Improving the accuracy of forest viewsheds using triangulated networks and the visual permeability method , 1997 .

[15]  András Rácz,et al.  A Lower Bound for the Integer Element Distinctness Problem , 1991, Inf. Comput..

[16]  J. Parrot,et al.  Measurement of DEM roughness using the local fractal dimension , 2005 .

[17]  B. Joe,et al.  Corrections to Lee's visibility polygon algorithm , 1987, BIT.

[18]  Michael J. Meitner,et al.  A route-based visibility analysis for landscape management , 2013 .

[19]  Erich Tasser,et al.  Predicting scenic beauty of mountain regions , 2013 .

[20]  Maarten Löffler,et al.  Practical Approaches to Partially Guarding a Polyhedral Terrain , 2014, GIScience.

[21]  Timothy M. Chan.  More Logarithmic-Factor Speedups for 3SUM, (median, +)-Convolution, and Some Geometric 3SUM-Hard Problems , 2018, SODA.

[22]  W. Henry McNab,et al.  Terrain shape index: quantifying effect of minor landforms on tree height , 1989 .

[23]  Yevgeny Schreiber.  An Optimal-Time Algorithm for Shortest Paths on Realistic Polyhedra , 2010, Discret. Comput. Geom..

[24]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[25]  Mark H. Overmars,et al.  On a Class of O(n2) Problems in Computational Geometry , 1995, Comput. Geom..

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

[27]  Mark G. Johnson,et al.  Scale-dependency of LiDAR derived terrain attributes in quantitative soil-landscape modeling: Effects of grid resolution vs. neighborhood extent , 2014 .