Inverse distance weighting (IDW) interpolation and viewshed are two popular algorithms for geospatial analysis. IDW interpolation assigns geographical values to unknown spatial points using values from a usually scattered set of known points

and viewshed identifies the cells in a spatial raster that can be seen by observers. Although the implementations of both algorithms are available for different scales of input data

the computation for a large-scale domain requires a mass amount of cycles

which limits their usage. Due to the growing popularity of the graphics processing unit (GPU) for general purpose applications

we aim to accelerate geospatial analysis via a GPU based parallel computing approach. In this paper

we propose a generic methodological framework for geospatial analysis based on GPU and its programming model Compute Unified Device Architecture (CUDA)

and explore how to map the inherent parallelism degrees of IDW interpolation and viewshed to the framework

which gives rise to a high computational throughput. The CUDA-based implementations of IDW interpolation and viewshed indicate that the architecture of GPU is suitable for parallelizing the algorithms of geospatial analysis. Experimental results show that the CUDA-based implementations running on GPU can lead to dataset dependent speedups in the range of 13–33-fold for IDW interpolation and 28–925-fold for viewshed analysis. Their computation time can be reduced by an order of magnitude compared to classical sequential versions

without losing the accuracy of interpolation and visibility judgment.