Computing Visibility on Terrains in External Memory

ACM Journal of Experimental Algorithmics

Volumn 13, Issue , 2009, Pages 1.5-1.23

  Haverkort, Herman ^a   Toma, Laura ^b   Zhuang, Yi ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b BOWDOIN COLLEGE   (United States)

Author keywords

Algorithms; Computational geometry; data structures and algorithms; Design; digital elevation models; Experimentation; I O efficiency; Performance; terrains; visibility

Indexed keywords

EID: 85016217144     PISSN: 10846654     EISSN: 10846654     Source Type: Journal    
DOI: 10.1145/1412228.1412233     Document Type: Article

References (25)

1. Agarwal, P. K., Bereg, S., Daescu, O., Kaplan, H., Ntafos, S., and Zhu, B. 2005. Guarding a terrain by two watchtowers. In Proceedings of the ACM Symposium on Computational Geometry. 346-355.
2. Aggarwal, A. and Vitter, J. S. 1988. The Input/Output complexity of sorting and related problems. Communications of the ACM 31, 9, 1116-1127. Ajwani, D., Meyer, U., and Osipov, V. 2007. Improved external memory bfs implementations. In alenex.
3. Arge, L. 1997. External-memory algorithms with applications in geographic information systems. In Algorithmic Foundations of GIS, M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer, Eds. Springer-Verlag, LNCS 1340, 213-254.
4. Arge, L., Barve, R. D., Hutchinson, D., Procopiuc, O., Toma, L., Vahrenhold, J., Vengroff, D. E., and Wickremesinghe, R. 2005. TPIE user manual and reference, edition 1.0. Duke University, NC, “http://www.cs.duke.edu/TPIE/”. (In Preparation).
5. Arge, L., Brodal, G. S., and Fagerberg, R. 2005. Cache-oblivious Algorithms. Vol. Handbook of Data Structures and Applications. CRC Press, Chapter 34.
6. Arge, L., Toma, L., and Vitter, J. S. 2001. I/O-efficient algorithms for problems on grid-based terrains. ACM J. Experimental Algorithmics 6. Article 1.
7. Arge, L., Vengroff, D. E., and Vitter, J. S. 1995. External-memory algorithms for processing line segments in geographic information systems. In Proceedings of the European Symposium on Algorithms. LNCS 979. 295-310.
8. Ben-Moshe, B., Katz, M. J., and Mitchell, J. S. B. 2005. A constant-factor approximation algorithm for optimal terrain guarding. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. 515-524.
9. Brodal, G. S. 2004. Cache-oblivious algorithms and data structures. In Proceedings of the Scandinavian Workshop on Algorithms Theory. LNCS 3111. 3-13.
10. Brodal, G. S. and Fagerberg, R. 2002. Cache oblivious distribution sweeping. In Proceedings of the International Colloquium on Automata, Languages, and Programming. LNCS 2389. 426-438.
11. Brodal, G. S., Fagerberg, R., and Vinther, K. 2007. Engineering a cache-oblivious sorting algorithm. J Exp. Algorithmics 12, 22.
12. Cole, R. and Sharir, M. 1989. Visibility problems for polyhedral terrains. J Symb. Comput. 7,1, 11-30.
13. Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms, 2nd ed. The MIT Press, Cambridge, Mass. Danner, A. 2007. Private communication.
14. de Floriani, L. and Magillo, P. 1994. Visibility algorithms on digital terrain models. International Journal of Geographic Information Systems 8, 1, 13-41.
15. de Floriani, L. and Magillo, P. 1999. Geographic Information Systems: Principles, Techniques, Managament and Applications. John Wiley and Sons, Chapter Intervisibility of Terrains, 543-556.
16. Dementiev, R., Kettner, L., and Sanders, P. 2005. Stxxl: Standard template library for xxl data sets. In Proceedings of the European Symposium on Algorithms. LNCS 3669. 640-651.
17. Fisher, P. 1993. Algorithm and implementation uncertainty in viewshed analysis. International Journal of GIS 7, 331-347.
18. Fisher, P. 1994. Stretching the viewshed. In Proceedings of the Symposium on Spatial Data Handling. 725-738.
19. Franklin, W. R. 2002. Siting observers on terrain. In Proceedings of the Symposium on Spatial Data Handling.
20. Franklin, W. R. and Ray, C. 1994. Higher isn’t necessarily better: Visibility algorithms and experiments. in Proceedings ofthe Symposium on Spatial Data Handling. 751-763.
21. Frigo, M., Leiserson, C. E., Prokop, H., and Ramachandran, S. 1999. Cache-oblivious algorithms. in Proceedings ofthe IEEE Symposium on Foundations of Computer Science. 285-298.
22. Goodrich, M. T., Tsay, J.-J., Vengroff, D. E., and Vitter, J. S. 1993. External-memory computational geometry. in Proceedings ofthe IEEE Symposium on Foundations of Computer Science. 714-723.
23. Toma, L. 2003. External memory graph algorithms and applications to geographic information systems. Ph. D. thesis, Duke University.
24. van Kreveld, M. 1996. Variations on sweep algorithms: efficient computation of extended view-sheds and class intervals. In Proceedings of the Symposium on Spatial Data Handling. 15-27.
25. van Kreveld, M., Nievergelt, J., Roos, T., and (Eds.), P. W. 1997. Algorithmic Foundations of GIS. LNCS 1340. Springer-Verlag.