Skip to main content
Log in

Parallel viewshed analysis on a PC cluster system using triple-based irregular partition scheme

  • Methodology Article
  • Published:
Earth Science Informatics Aims and scope Submit manuscript

Abstract

Using digital elevation models (DEMs), viewshed analysis algorithms determine the visibility of each point on the terrain at a given location in space. As a data-parallel algorithm, real-time viewshed analysis from grid DEM poses a practical challenge to personal computer (PC) users, particularly when dealing with higher resolution and accuracy of large terrain data. Therefore, this paper presents a universal domain decomposition algorithm based on an equal-area strategy for the parallel viewshed analysis on a PC cluster system. The approach uses a scan-line filling method for data partitioning of the irregular bounding polygon of the terrain. The terrain data are divided into sectors of the same area that are connected by the viewpoint and the region vertices, ignoring the null value (or NODATA) points. Furthermore, each sector is assigned to one processor and is organized in the form of triples composed of location and elevation at one point. An index of triples is built to store all of the locations of terminal vertices row-by-row and thus the random access of any point is achieved by using the offsets in each row. Two commonly applied viewshed algorithms, namely, “reference plane” and “Xdraw” algorithms are employed to verify the performance. In addition, two experiments focus on evaluating the efficiency performance and comparing traditional implementation, respectively. Experimental results demonstrate a significant performance improvement compared with the sequential computing method. The memory usage gradually decreases as the number of processors increases. Based on the equal-area decomposition, partitions in terms of sectors can guarantee a suitable load balance. Additional benefits of the proposed solution also include high storage efficiency and program portability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  • Bongers J, Arkush E, Harrower M (2012) Landscapes of death: GIS-based analyses of chullpas in the western Lake Titicaca basin. J Archaeol Sci 39(6):1687–1693

    Article  Google Scholar 

  • Coll N, Fort M, Madern N, Sellarès JA (2007) Multi-visibility maps of triangulated terrains. Int J Geogr Inf Sci 21(10):1115–1134

    Article  Google Scholar 

  • De Floriani L, Montani C, Scopigno R (1994) Parallelizing visibility computations on triangulated terrains. Int J Geogr Inf Syst 8(6):515–531

    Article  Google Scholar 

  • De Oliveira D, Ocaña KACS, Ogasawara E, Dias J, Gonçalves J, Baião F, Mattoso M (2013) Performance evaluation of parallel strategies in public clouds: a study with phylogenomic workflows. Futur Gener Comput Syst 29(7):1816–1825

    Article  Google Scholar 

  • Fang C, Yang C, Chen Z, Yao X, Guo H (2011) Parallel algorithm for viewshed analysis on a modern GPU. International Journal of Digital Earth 4(6):471–486

    Article  Google Scholar 

  • Fishman J, Haverkort H, Toma L (2009) Improved visibility computation on massive grid terrains. In: Proceedings of the 17th ACM SIGSPATIAL international conference on advances in geographic information systems, 4–6 2009, Seattle. New York: ACM, pp 121–130

  • Franklin WR, Ray CK, Mehta S (1994) Geometric algorithms for sitting of air defense missile batteries. Research Project for Battelle, Columbus Division, Contract Number DAAL03–86-D-0001, Delivery Order No. 2756

  • Germain D, Laurendeau D, Vézina G (1996) Visibility analysis on a massively data-parallel computer. Concurrency: Practice and Experience 8(6):475–487

    Article  Google Scholar 

  • Gong J, Xie J (2009) Extraction of drainage networks from large terrain datasets using high throughput computing. Comput Geosci 35(2):337–346

    Article  Google Scholar 

  • Goodchild MF, Lee J (1989) Coverage problems and visibility regions on topographic surfaces. Ann Oper Res 18(1):175–186

    Article  Google Scholar 

  • Guan X, Wu H (2010) Leveraging the power of multi-core platforms for large-scale geospatial data processing: exemplified by generating DEM from massive LiDAR point clouds. Comput Geosci 36(10):1276–1282

    Article  Google Scholar 

  • Haverkort H, Toma L, Zhuang Y (2009) Computing visibility on terrains in external memory. Journal of Experimental Algorithmic 13(5):1–23

    Google Scholar 

  • Izraelevitz D (2003) A fast algorithm for approximate viewshed computation. Photogramm Eng Remote Sens 69(7):767–774

    Article  Google Scholar 

  • Kent M (1986) Visibility analysis of mining and waste tipping sites – a review. Landsc Urban Plan 13:101–110

    Article  Google Scholar 

  • Kidner DB, Railings PJ, Ware JA (1997) Parallel processing for terrain analysis in GIS: visibility as a case study. GeoInformatica 1(2):183–207

    Article  Google Scholar 

  • Kim Y, Rana S, Wise S (2004) Exploring multiple viewshed analysis using terrain features and optimization techniques. Comput Geosci 30(9–10):1019–1032

    Article  Google Scholar 

  • Lee J (1991) Analyses of visibility sites on topographic surfaces. Int J Geogr Inf Sci 5(4):413–429

    Article  Google Scholar 

  • Llobera M, Wheatley D, Steele J, Cox S, Parchment O (2004) Calculating the inherent visual structure of a landscape (total viewshed) using high-throughput computing. In: Niccolucci F, Hermon S (eds) Beyond the artifact: digital interpretation of the past, CAA 04. Budapest, Archaeolingua, pp. 146–151

    Google Scholar 

  • Lu M, Zhang JF, Lv P, Fan ZH (2008) Least visible path analysis in raster terrain. Int J Geogr Inf Sci 22(6):645–656

    Article  Google Scholar 

  • Magalhães MA, Magalhães SVG, Andrade MVA, Filho JL (2007) An efficient algorithm to compute the viewshed on DEM terrains stored in the external memory. In: Proceedings of the IX Brazilian symposium on GeoInformatics, 25–28 November 2007, Campos do Jordão. Brazil, INPE, pp. 183–194

    Google Scholar 

  • Mateescua G, Gentzsch W, Ribbens CJ (2011) Hybrid computing-where HPC meets grid and cloud computing. Future Generation Computer 27(5):440–453

    Article  Google Scholar 

  • Mills K, Fox G, Heimbach R (1992) Implementing an intervisibility analysis model on a parallel computing system. Comput Geosci 18(8):1047–1054

    Article  Google Scholar 

  • Mineter MJ, Dowers S, Caldwell DR, Gittings BM (2003) High-throughput Computing to Enhance Intervisibility Analysis. Proceedings of the 7th International Conference on GeoComputation. Southampton, United Kingdom

  • Schiele S, Möller M, Blaar H, Thürkow D, Müller-Hannemann M (2012) Parallelization strategies to deal with non-localities in the calculation of regional land-surface parameters. Comput Geosci 44:1–9

    Article  Google Scholar 

  • Tabik S, Zapata EL, Romero LF (2012) Simultaneous computation of total viewshed on large high resolution grids. Int J Geogr Inf Sci 27(4):804–814

    Article  Google Scholar 

  • Teng YA, Dementhon D, Davis LS (1993a) Stealth terrain navigation. IEEE Transactions on Systems, Man, and Cybernetics 23(1):96–110

    Article  Google Scholar 

  • Teng YA, DeMenthon D, Davis LS (1993b) Region-to-region visibility analysis using data parallel machines. Concurrency: Practice and Experience 5(5):379–406

    Article  Google Scholar 

  • Wang J, Robinson GJ, White K (1996) A fast solution to local viewshed computation using grid-based digital elevation models. Photogramm Eng Remote Sens 62(10):1157–1164

    Google Scholar 

  • Wang J, Robinson GJ, White K (2000) Generating viewsheds without using sightlines. Photogramm Eng Remote Sens 66:87–90

    Google Scholar 

  • Winter-Livneh R, Svoray T, Gilead I (2012) Secondary burial cemeteries, visibility and land tenure: a view from the southern Levant chalcolithic period. J Anthropol Archaeol 31(4):423–438

    Article  Google Scholar 

  • Wu H, Pan M, Yao L, Luo B (2007) A partition-based serial algorithm for generating viewshed on massive DEMs. Int J Geogr Inf Sci 21(9):955–964

    Article  Google Scholar 

  • Yan W, Brahmakshatriya U, Xue Y, Gilder M, Wise B (2013) P-PIC: parallel power iteration clustering for big data. Journal of Parallel and Distributed Computing 73(3):352–359

    Article  Google Scholar 

  • Yu WW, He F, Xi P (2010) A rapid 3D seed-filling algorithm based on scan slice. Comput Graph 34(4):449–459

    Article  Google Scholar 

  • Zhao Y, Padmanabhan A, Wang S (2013) A parallel computing approach to viewshed analysis of large terrain data using graphics processing units. Int J Geogr Inf Sci 27(2):363–384

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported by the Major Scientific Research Projects of Universities in Jiangsu Province (No. 13KJA170001), the Priority Academic Program Development of Jiangsu Higher Education Institutions (No. 164320H101), the National Natural Science Foundation of China (No. 41401237, No. 41571383), the Jiangsu Province Science Foundation for Youths (No. BK20141053), and the Field Frontier Program of the Institute of Soil Science, Chinese Academy of Sciences (No. ISSASIP1624). The cluster support provided by Dr. Gan-Lin Zhang, Institute of Soil Science, Chinese Academy of Sciences, is gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Guo-An Tang.

Additional information

Communicated by: H. A. Babaie

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, XD., Tang, GA., Liu, XJ. et al. Parallel viewshed analysis on a PC cluster system using triple-based irregular partition scheme. Earth Sci Inform 9, 511–523 (2016). https://doi.org/10.1007/s12145-016-0263-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12145-016-0263-5

Keywords

Navigation