Centre de documentation
scientifique

A partition-based serial algorithm for generating viewshed on massive DEMs / H. Wu in International journal of geographical information science IJGIS, vol 21 n° 9-10 (october 2007)  

Public [article]  inInternational journal of geographical information science IJGIS > vol 21 n° 9-10 (october 2007) . - pp 955 - 964 Titre : A partition-based serial algorithm for generating viewshed on massive DEMs Type de document : Article/Communication Auteurs : H. Wu, Auteur ; M. Pan, Auteur ; L. Yao, Auteur ; B. Luo, Auteur Année de publication : 2007 Article en page(s) : pp 955 - 964 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Applications photogrammétriques [Termes IGN] algorithme géométrique [Termes IGN] modèle numérique de surface [Termes IGN] partitionnement par bloc Résumé : (Auteur) As increasingly large-scale and higher-resolution terrain data have become available, for example air-form and space-borne sensors, the volume of these datasets reveals scalability problems with existing GIS algorithms. To address this problem, a kind of serial algorithm was developed to generate viewshed on large grid-based digital elevation models (DEMs). We first divided the whole DEM into rectangular blocks in row and column directions (called block partitioning), then processed these blocks with four axes followed by four sectors sequentially. When processing the particular block, we adopted the 'reference plane' algorithm to calculate the visibility of the target point on the block, and adjusted the calculation sequence according to the different spatial relationships between the block and the viewpoint since the viewpoint is not always inside the DEM. By adopting the 'Reference Plane' algorithm and using a block partitioning method to segment and load the DEM dynamically, it is possible to generate viewshed efficiently in PC-based environments. Experiments showed that the divided block should be dynamically loaded whole into computer main memory when partitioning, and the suggested approach retains the accuracy of the reference plane algorithm and has near linear compute complexity. Copyright Taylor & Francis Numéro de notice : A2007-551 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article DOI : 10.1080/13658810601034218 En ligne : https://doi.org/10.1080/13658810601034218 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=28914 [article]

Exemplaires(2)

Code-barres	Cote	Support	Localisation	Section	Disponibilité
079-07061	RAB	Revue	Centre de documentation	En réserve L003	Disponible
079-07062	RAB	Revue	Centre de documentation	En réserve L003	Disponible