Efficient viewshed computation on terrain in external memory

Efficient viewshed computation on terrain in external memory,10.1007/s10707-009-0100-9,Geoinformatica,Marcus V. A. Andrade,Salles V. G. Magalhães,Mire

Efficient viewshed computation on terrain in external memory   (Citations: 1)
BibTex | RIS | RefWorks Download
The recent availability of detailed geographic data permits terrain applications to process large areas at high resolution. However the required massive data processing presents significant challenges, demanding algorithms optimized for both data movement and computation. One such application is viewshed computation, that is, to determine all the points visible from a given point p. In this paper, we present an efficient algorithm to compute viewsheds on terrain stored in external memory. In the usual case where the observer’s radius of interest is smaller than the terrain size, the algorithm complexity is θ(scan(n 2)) where n 2 is the number of points in an n × n DEM and scan(n 2) is the minimum number of I/O operations required to read n 2 contiguous items from external memory. This is much faster than existing published algorithms.
Journal: Geoinformatica , vol. 15, no. 2, pp. 381-397, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: