I/O-efficient algorithms for problems on grid-based terrains

ACM Journal of Experimental Algorithmics

Volumn 6, Issue , 2001, Pages

  Arge, Lars ^a   Toma, Laura ^a   Vitter, Jeffrey Scott ^a  

^a Duke University   (United States)

Author keywords

Connected components; Flow; I O model; Shortest paths

Indexed keywords

EID: 3943059676     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/945394.945395     Document Type: Article

References (38)

1. NASA Earth Observing System (EOS) project, http://eos.nasa.gov/.
2. NASA Shuttle Radar Topography Mission (SRTM). http://www-radar.jpl.nasa. gov/srtm/.
3. U.S. Geological Survey: Five minute Gridded Earth Topography Data (ETOPO5). http://edcwww.cr.usgs.gov/Webglis/glisbin/guide.pl/glis/hyper/guide/ etopo5.
4. U.S. Geological Survey: Global thirty arc second Elevation Dataset (GTOPO30). http://edcwww.cr.usgs.gov/landdaac/gtopo30/gtopo30.html.
5. U.S. Geological Survey (USGS) digital elevation models. http://mcmcweb.er.usgs.gov/status/dem-stat.html.
6. Abello, J., Buchsbaum, A. L., and Westbrook., J. R. 1998. A functional approach to external graph algorithms. In Proc. Annual European Symposium on Algorithms, LNCS 1461 (1998), pp. 332-343.
7. Agarwal, P. K., Arge, L., Murali, T. M., Varadarajan, K., and Vitter, J. S. 1998. I/O-efficient algorithms for contour line extraction and planar graph blocking. In Proc. ACM-SIAM Symp. on Discrete Algorithms (1998), pp. 117-126.
8. Aggarwal, A. and Vitter, J. S. 1988. The Input/Output complexity of sorting and related problems. Communications of the ACM 31, 9, 1116-1127.
9. ARC/INFO. 1993. Understanding GIS-the ARC/INFO method. ARC/INFO. Rev. 6 for workstations.
10. Arge, L. 1995a. The buffer tree: A new technique for optimal I/O-algorithms. In Proc. Workshop on Algorithms and Data Structures, LNCS 955 (1995), pp. 334-345. A complete version appears as BRICS technical report RS-96-28, University of Aarhus.
11. Arge, L. 1995b. The I/O-complexity of ordered binary-decision diagram manipulation. In Proc. Int. Symp. on Algorithms and Computation, LNCS 1004 (1995), pp. 82-91. A complete version appears as BRICS technical report RS-96-29, University of Aarhus.
12. Arge, L., Barve, R., Procopiuc, O., Toma, L., Vengroff, D. E., and Wick- eremesinghe, R. 1999. TPIE User Manual and Reference (edition 0.9.01a). Duke University. The manual and software distribution are available on the web at http://www.cs.duke.edu/TPIE/.
13. Arge, L., Brodal, G. S., and Toma, L. 2000. On external memory MST, SSSP and multi-way planar graph separation. In Proc. Scandinavian Workshop on Algorithms Theory (2000).
14. Brengel, K., Crauser, A., Ferragina, P., and Meyer, U. 1999. An experimental study of priority queues in external memory. In Proc. Workshop on Algorithm Engineering, LNCS 1668 (1999), pp. 345-358.
15. Brodal, G. S. and Katajainen, J. 1998. Worst-case efficient external-memory priority queues. In Proc. Scandinavian Workshop on Algorithms Theory, LNCS 1432 (1998), pp. 107-118.
16. Buchsbaum, A. L., Goldwasser, M., Venkatasubramanian, S., and Westbrook, J. R. 2000. On external memory graph traversal. In Proc. ACM-SIAM Symp. on Discrete Algorithms (2000), pp. 859-860.
17. Chiang, Y.-J., Goodrich, M. T., Grove, E. F., Tamassia, R., Vengroff, D. E., and Vitter, J. S. 1995. External-memory graph algorithms. In Proc. ACM-SIAM Symp. on Discrete Algorithms (1995), pp. 139-149.
18. Dijkstra, E. W. 1969. A note on two problems in connection with graphs. Numerische Mathematik.
19. Fairfield, J. and Leymarie, P. 1991. Drainage network from grid digital elevation model. Water Resource Research 27, 709-717.
20. Feuerstein, E. and Marchetti-Spaccamela, A. 1993. Memory paging for connectivity and path problems in graphs. LNCS 762, 416-425.
21. Frank, A. U., Palmer, B., and Robinson, V. B. 1986. Formal methods for the accurate definition of some fundamental terms in physical geography. In Proc. 2nd Int. Symp. on Spatial Data Handling (1986), pp. 583-599.
22. Frederickson, G. N. 1987. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal of Computing 16, 1004-1022.
23. Hutchinson, D., Maheshwari, A., and Zeh, N. 1999. An external memory data structure for shortest path queries. In Proc. 5th Annual Int. Conf. Computing and Combinatorics, Number 1627 in LNCS (July 1999). Springer-Verlag.
24. Knuth, D. E. 1998. Sorting and Searching (second ed.), Volume 3 of The Art of Computer Programming. Addison-Wesley, Reading MA.
25. Kreveld, M. V. 1997. Digital elevation models: overview and selected TIN algorithms. In M. van Kreveld, J. Nievergelt, T. Roos, and P. Widmayer Eds., Algorithmic Foundations of GIS. Springer-Verlag, Lecture Notes in Computer Science 1340.
26. Kumar, V. and Schwabe, E. 1996. Improved algorithms and data structures for solving graph problems in external memory. In Proc. IEEE Symp. on Parallel and Distributed Processing (1996), pp. 169-177.
27. Maheshwari, A. and Zeh, N. 1999. External memory algorithms for outerplanar graphs. Manuscript.
28. Moore, I. D. 1996. Hydrologic Modeling and GIS, Chapter 26, pp. 143-148. GIS World Books. Boulder.
29. GIS World Books. Boulder. Moore, I. D., Grayson, R. B., and Ladson, A. R. 1991. Digital terrain modelling: a review of hydrological, geomorphological and biological aplications. Hydrological Processes 5, 3-30.
30. Moore, I. D., Turner, A. K., Wilson, J. P., Jenson, S. K., and Band, L. E. 1993. GIS and Environmental Modelling. Oxford University Press.
31. Munagala, K. and Ranade, A. 1999. I/O-complexity of graph algorithm. In Proc. ACM- SIAM Symp. on Discrete Algorithms (1999), pp. 687-694.
32. Nodine, M. H., Goodrich, M. T., and Vitter, J. S. 1996. Blocking for external graph searching. Algorithmica 16, 2, 181-214.
33. O'Callaghan, J. F. and Mark, D. M. 1984. The extraction of drainage networks from digital elevation data. Computer Vision, Graphics and Image Processing 28.
34. Ullman, J. D. and Yannakakis, M. 1991. The input/output complexity of transitive closure. Annals of Mathematics and Artificial Intellegence 3, 331-360.
35. Vengroff, D. E. 1994. A transparent parallel I/O environment. In Proc. DAGS Symposium on Parallel Computation (1994).
36. Vitter, J. S. 1998. External memory algorithms (invited tutorial). In Proc. of the 1998 ACM Symposium on Principles of Database Systems (1998), pp. 119-128.
37. Wolock, D. 1993. Simulating the variable-source-area of streamflow generation with the watershed model topmodel. Technical report, U.S. Department of the Interior.
38. Yu, S., van Kreveld, M., and Snoeyink, J. 1996. Drainage queries on TINs: from local to global and back again. In Proc. 7th Int. Symp. on Spatial Data Handling (1996), pp. 13A.1-13A.14.