Efficient Implementation of a Fast Viewshed Algorithm on SIMD Architectures

View shed refers to the land area that is visible to an observer placed in a point of a terrain. Due to the advances in remote sensing technologies the volume of data is today beyond the capability of traditional GIS tools and therefore new and fast algorithms become essential. In this paper we present an efficient implementation of the XDRAW algorithm [5] to quickly compute view sheds on very large digital elevation models. We redesign the algorithm to make it IO-efficient and compatible with modern SIMD architectures. Our implementation is able to compute view sheds on digital elevation models at the rate of 109 points per second on an Intel quad-core CPU with AVX2 technology, which makes the algorithm suitable for real-time applications.

[1]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[2]  Laura Toma,et al.  Improved visibility computation on massive grid terrains , 2009, GIS.

[3]  Laura Toma,et al.  Computing visibility on terrains in external memory , 2007, JEAL.

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

[5]  Laura Toma,et al.  On IO-efficient viewshed algorithms and their accuracy , 2013, SIGSPATIAL/GIS.

[6]  Laura Toma,et al.  Viewsheds on terrains in external memory , 2012, SIGSPACIAL.

[7]  David Izraelevitz,et al.  A Fast Algorithm for Approximate Viewshed Computation , 2003 .

[8]  M. Llobera,et al.  Extending GIS-based visual analysis: the concept of visualscapes , 2003, Int. J. Geogr. Inf. Sci..

[9]  Jay Lee,et al.  On Applying Viewshed Analysis for Determining Least-Cost Paths on Digital Elevation Models , 1998, Int. J. Geogr. Inf. Sci..

[10]  M. J. van Kreveld,et al.  Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals , 1996 .

[11]  Richard Vuduc,et al.  Modern Accelerator Technologies for Geographic Information Science , 2013, Springer US.

[12]  Jianjun Wang,et al.  Generating Viewsheds without Using Sightlines , 2000 .

[13]  W. Randolph Franklin.  Higher isn ’ t Necessarily Better : Visibility Algorithms and Experiments , 1994 .

[14]  Patrik Ritosa,et al.  An IO-efficient parallel implementation of an R2 viewshed algorithm for large terrain maps on a CUDA GPU , 2014, Int. J. Geogr. Inf. Sci..

[15]  Desh Ranjan,et al.  Space-Filling Curves and Their Use in the Design of Geometric Data Structures , 1997, Theor. Comput. Sci..

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

[17]  Shaowen Wang,et al.  A parallel computing approach to viewshed analysis of large terrain data using graphics processing units , 2013, Int. J. Geogr. Inf. Sci..