The input/output complexity of sorting and related problems
Communications of the ACM
Discrete Mathematics
Approximation algorithms for terrain guarding
Information Processing Letters
Fast Horizon Computation at All Points of a Terrain With Visibility and Shading Applications
IEEE Transactions on Visualization and Computer Graphics
On the Planar Two-Watchtower Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Efficient Flow Computation on Massive Grid Terrain Datasets
Geoinformatica
Visibility preserving terrain simplification: an experimental study
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Automated antenna positioning algorithms for wireless fixed-access networks
Journal of Heuristics
A Constant-Factor Approximation Algorithm for Optimal 1.5D Terrain Guarding
SIAM Journal on Computing
External-memory computational geometry
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Exploring multiple viewshed analysis using terrain features and optimisation techniques
Computers & Geosciences
Algorithm for computer control of a digital plotter
IBM Systems Journal
Viewsheds on terrains in external memory
SIGSPATIAL Special
More efficient terrain viewshed computation on massive datasets using external memory
Proceedings of the 20th International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
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.