Efficient Flow Computation on Massive Grid Terrain Datasets

As detailed terrain data becomes available, GIS terrain applications target larger geographic areas at finer resolutions. Processing the massive datasets involved in such applications presents significant challenges to GIS systems and demands algorithms that are optimized for both data movement and computation. In this paper we present efficient algorithms for flow routing on massive grid terrain datasets, extending our previous work on flow accumulation. Our algorithms are developed in the framework of external memory algorithms and use I/O-techniques to achieve efficiency. We have implemented the algorithms in the Terraflow system, which is the first comprehensive terrain flow software system designed and optimized for massive data. We compare the performance of Terraflow with that of state-of-the-art commercial and open-source GIS systems. On large terrains, Terraflow outperforms existing systems by a factor of 2 to 1,000, and is capable of solving problems no system was previously able to solve.

[1]  John F. O'Callaghan,et al.  The extraction of drainage networks from digital elevation data , 1984, Comput. Vis. Graph. Image Process..

[2]  S. K. Jenson,et al.  Extracting topographic structure from digital elevation data for geographic information-system analysis , 1988 .

[3]  Lawrence W. Martz,et al.  Numerical definition of drainage network and subcatchment areas from digital elevation models , 1992 .

[4]  L. Martz,et al.  The assignment of drainage direction over flat surfaces in raster digital elevation models , 1997 .

[5]  Gerth Stølting Brodal,et al.  Worst-Case External-Memory Priority Queues , 1998, SWAT.

[6]  David M. Wolock,et al.  SIMULATING THE VARIABLE-SOURCE-AREA CONCEPT OF STREAMFLOW GENERATION WITH THE WATERSHED MODEL TOPMODEL , 1993 .

[7]  Gregory J. McCabe,et al.  Comparison of Single and Multiple Flow Direction Algorithms for Computing Topographic Parameters in TOPMODEL , 1995 .

[8]  Lars Arge,et al.  The Buuer Tree: a New Technique for Optimal I/o-algorithms ? , 1995 .

[9]  D. Tarboton.  A new method for the determination of flow directions and upslope areas in grid digital elevation models , 1997 .

[10]  Jeffrey Scott Vitter,et al.  I/O-Efficient Algorithms for Problems on Grid-Based Terrains , 2001, JEAL.

[11]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[12]  I. Moore,et al.  Digital terrain modelling: A review of hydrological, geomorphological, and biological applications , 1991 .

[13]  Lars Arge,et al.  External Memory Data Structures , 2001, ESA.

[14]  Andrea Tribe,et al.  Automated recognition of valley lines and drainage networks from grid digital elevation models: a review and a new method , 1992 .

[15]  Lars Arge,et al.  The Buffer Tree: A New Technique for Optimal I/O-Algorithms (Extended Abstract) , 1995, WADS.

[16]  David G. Tarboton,et al.  On the extraction of channel networks from digital elevation data , 1991 .

[17]  Michael F. Goodchild,et al.  Gis and Environmental Modeling: Progress and Research Issues , 1996 .

[18]  Richard G. Heerdegen,et al.  Automatically derived catchment boundaries and channel networks and their hydrological applications , 1988 .

[19]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[20]  Gerth Stølting Brodal,et al.  Worst-Case Efficient External-Memory Priority Queues , 1998 .

[21]  J. Fairfield,et al.  Drainage networks from grid digital elevation models , 1991 .

[22]  T. G. Freeman,et al.  Calculating catchment area with divergent flow based on a regular grid , 1991 .