A Parallel Algorithm for Viewshed Computation on Grid Terrains

Viewshed (or visibility map) computation is an important component in many GIS applications and, as nowadays there are huge volume of terrain data available at high resolutions, it is important to develop efficient algorithms to process these data. Since the main improvements on modern processors come from multi-core architectures, parallel programming provides a promising means for developing faster algorithms. In this paper, we describe a new parallel algorithm based on the model proposed by [Van Kreveld 1996]. Our algorithm uses the shared memory model, which is relatively cheap and supported by most current processors.Experiments have shown that, with 16 parallel cores, it was up to 12 times faster than the serial implementation, and up to 3.9 times using four parallel cores, which is an almost optimal speedup.

[1]  Chen Zhuo,et al.  Parallel algorithm for viewshed analysis on a modern GPU , 2011, Int. J. Digit. Earth.

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

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

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

[5]  Andrej Osterman,et al.  Implementation of the r . cuda . los module in the open source GRASS GIS by using parallel computation on the NVIDIA CUDA graphic cards , 2012 .

[6]  I. Bateman,et al.  Modelling environmental influences on property prices in an urban environment , 1998 .

[7]  Michael Segal,et al.  Automated antenna positioning algorithms for wireless fixed-access networks , 2007, J. Heuristics.

[8]  Yaohan Chu,et al.  Electronic digital integrating computers : digital differential analyzers , 1964 .

[9]  L. Dagum,et al.  OpenMP: an industry standard API for shared-memory programming , 1998 .

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

[11]  Salles V. G. Magalhães,et al.  Multiple Observer Siting in Huge Terrains Stored in External Memory , 2011 .

[12]  Qing Zhu,et al.  Digital terrain modeling - principles and methodology , 2004 .

[13]  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..

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

[15]  References , 1971 .

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