An efficient algorithm to compute the viewshed on DEM terrains stored in the external memory

Proceedings of the Brazilian Symposium on GeoInformatics

Volumn , Issue , 2007, Pages 183-194

  Magalhaes, Mirella A ^a   Magalhaes, Salles V G ^a   Andrade, Marcus V A ^a   Filho, Jugurta Lisboa ^a  

^a FEDERAL UNIVERSITY OF VIÇOSA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM COMPLEXITY; EXTERNAL MEMORY; GIS APPLICATION; I/O OPERATIONS; INTERNAL MEMORY;

GEOGRAPHIC INFORMATION SYSTEMS;

ALGORITHMS;

EID: 61849152661     PISSN: None     EISSN: 21794847     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Aggarwal, A. and Vitter, J. S. (1988). The input/output complexity of sorting and related problems. Communications of the ACM, 9:1116-1127.
2. Arge, L. (1997). External-memory algorithms with applications in geographic information systems. In In M. van Kreveld, J. Nievergelt, T. R. e. P. W., editor, Algorithmic Foundations of GIS. Springer-Verlag.
3. Arge, L., and Chase., J. S., Halpin, P., Toma, L., Vitter, J. S., Urban, D., and Wickremesinghe, R. (2003). Efficient flow computation on massive grid terrains. GeoInformatica, 7:283-313.
4. Arge, L., and Vengroff., D. E., and Vitter, J. S. (1995). External memory algorithms for processing line segments in geographic information systems. In In Proc. European Symposium on Algorithms, LNCS 979, pages 295-310.
5. Ben-Moshe, B., Ben-Shimol, Y., and Y. Ben-Yehezkel, A. Dvir, M. S. (2007a). Automated antenna positioning algorithms for wireless fixed-access networks. Journal of Heuristics, 13(3):243-263.
6. Ben-Moshe, B., Carmi, P., and Katz, M. (2004a). Approximating the visible region of a point on a terrain. In Proc. Algorithm Engineering and Experiments (ALENEX'04), pages 120-128.
7. Ben-Moshe, B., Katz, M., Mitchell, J., and Nir, Y. (2004b). Visibility preserving terrain simplification - an experimental study. Comp. Geom., Theory and Applications, 28:175-190.
8. Ben-Moshe, B., Katz, M. J., and Mitchell, J. S. B. (2007b). A constant-factor approximation algorithm for optimal 1.5d terrain guarding. SIAM J. Comput, 36(6):1631-1647.
9. Bespamyatnikh, S., Chen, Z., Wang, K., and Zhu, B. (2001). On the planar two-watchtower problem. In In 7th International Computing and Combinatorics Conference, pages 121-130.
10. Bresenham, J. (1965). An incremental algorithm for digital plotting. IBM Systems Journal.
11. Camp, R. J., and Sinton., D. T., and Knight, R. L. (1995). Viewsheds: A complementary management approach to buffer zones. Wildlife Society Bulletin, 25:612-615.
12. Creative Commons (2007). http://creativecommons.org/license/cc-gpl (accessed august 2007).
13. Dementiev, R., Kettner, L., and Sanders, P. (2005). Stxxl: Standard template library for xxl data sets. Technical report, Fakultat fur Informatik, Universitat Karlsruhe. http://stxxl.sourceforge.net/ (acessed on July 2007).
14. Eidenbenz, S. (2002). Approximation algorithms for terrain guarding. Inf. Process. Lett., 82(2):99-105.
15. Felgueiras, C. A. (2001). Modelagem numérica de terreno. In In G. Câmara, C. Davis, A. M. V. M., editor, Introdução à Ciência da Geoinformação, Volume 1. INPE.
16. Floriani, L. D. and Magillo, P. (2003). Algorithms for visibility computation on terrains: a survey. Environment and Planning B - Planning and Design, 30:709-728.
17. Floriani, L. D., Puppo, E., and Magillo, P. (1999). Applications of computational geometry to geographic information systems. In J. R. Sack, J. U., editor, Handbook of Computational Geometry, pages 303-311. Elsevier Science.
18. Franklin, W. R. (2002). Siting observers on terrain. In Springer-Verlag, editor, In D. Richardson and P. van Oosterom editors, Advances in Spatial Data Handling: 10th International Symposium on Spatial Data Handling, pages 109-120.
19. Franklin, W. R. and Ray, C. (1994). Higher isn't necessarily better - visibility algorithms and experiments. In 6th Symposium on Spatial Data Handling, Edinburgh, Scotland.
20. Franklin, W. R. and Vogt, C. (2006). Tradeoffs when multiple observer siting on large terrain cells. In 12th International Symposium on Spatial Data Handling.
21. Goodrich, M. T., and Tsay., J. J., Vangroff, D. E., and Vitter, J. S. (1993). External-memory computational geometry. In IEEE Symp. on Foundations of Computer Science, pages 714-723.
22. Haverkort, H., Toma, L., and Zhuang, Y. (2007). Computing visibility on terrains in external memory. In Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments / Workshop on Analytic Algorithms and Combinatorics (ALENEX/ANALCO).
23. Kumler, M. P. (1994). An intensive comparison of triangulated irregular network (tins) and digital elevation models (dems). Cartographica, 31(2).
24. Lake, I. R., and Lovett., A. A., Bateman, I. J., and Langford, I. H. (1998). Modeling environmental influences on property prices in an urban environment. Computers, Environment and Urban Systems, 22:121-136.
25. Lee, J. and Stucky, D. (1998). On applying viewshed analysis for determining least-cost paths on digital elevation models. Journal of Geographical Information Science, 12:891-905.
26. Li, Z., Zhu, Q., and Gold, C. (2005). Digital Terrain Modeling - principles and methodology. CRC Press.
27. Stewart, A. J. (1998). Fast horizon computation at all points of a terrain with visibility and shading applications. In IEEE Trans. Visualization Computer Graphics, pages 82-93.
28. USGS (2007). The USGS Center for LIDAR Information Coordination and Knowledge. http://lidar.cr.usgs.gov/ (accessed October 2007).
29. van Kreveld, M. (1996). Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals. In Symposium on Spatial Data Handling, pages 15-27.
30. Young-Hoom, K., Rana, S., and Wise, S. (2004). Exploring multiple viewshed analysis using terrain features and optimization techniques. Computers and Geosciences, 30:1019-10323.