Preprints
https://doi.org/10.5194/esurf-2020-31
https://doi.org/10.5194/esurf-2020-31

  05 May 2020

05 May 2020

Review status: a revised version of this preprint was accepted for the journal ESurf and is expected to appear here in due course.

Computing water flow through complex landscapes, Part 3: Fill-Spill-Merge: Flow routing in depression hierarchies

Richard Barnes1,2,3, Kerry L. Callaghan4,5, and Andrew D. Wickert4,5 Richard Barnes et al.
  • 1Energy & Resources Group (ERG), University of California, Berkeley, USA
  • 2Electrical Engineering & Computer Science, University of California, Berkeley, USA
  • 3Berkeley Institute for Data Science (BIDS), University of California, Berkeley, USA
  • 4Department of Earth & Environmental Sciences, University of Minnesota, Minneapolis, USA
  • 5Saint Anthony Falls Laboratory, University of Minnesota, Minneapolis, USA

Abstract. Depressions – inwardly-draining regions – are common to many landscapes. When there is sufficient moisture, depressions take the form of lakes and wetlands; otherwise, they may be dry. Hydrological flow models used in geomorphology, hydrology, planetary science, soil and water conservation, and other fields often eliminate depressions through filling or breaching; however, this can produce unrealistic results. Models that retain depressions, on the other hand, are often undesirably expensive to run. In previous work we began to address this by developing a depression hierarchy data structure to capture the full topographic complexity of depressions in a region. Here, we extend this work by presenting a Fill-Spill-Merge algorithm that utilizes our depression hierarchy to rapidly process and distribute runoff. Runoff fills depressions, which then overflow and spill into their neighbors. If both a depression and its neighbor fill, they merge. We provide a detailed explanation of the algorithm as well as results from two sample study areas. In these case studies, the algorithm runs 90–2600× faster (with a 2000–63 000× reduction in compute time) than the commonly-used Jacobi iteration and produces a more accurate output. Complete, well-commented, open-source code is available on Github and Zenodo.

Richard Barnes et al.

 
Status: closed
Status: closed
AC: Author comment | RC: Referee comment | SC: Short comment | EC: Editor comment
Printer-friendly Version - Printer-friendly version Supplement - Supplement
 
Status: closed
Status: closed
AC: Author comment | RC: Referee comment | SC: Short comment | EC: Editor comment
Printer-friendly Version - Printer-friendly version Supplement - Supplement

Richard Barnes et al.

Model code and software

Fill-Spill-Merge Source Code R. Barnes and K. Callaghan https://doi.org/10.5281/zenodo.3755142

Richard Barnes et al.

Viewed

Total article views: 711 (including HTML, PDF, and XML)
HTML PDF XML Total BibTeX EndNote
501 171 39 711 47 42
  • HTML: 501
  • PDF: 171
  • XML: 39
  • Total: 711
  • BibTeX: 47
  • EndNote: 42
Views and downloads (calculated since 05 May 2020)
Cumulative views and downloads (calculated since 05 May 2020)

Viewed (geographical distribution)

Total article views: 604 (including HTML, PDF, and XML) Thereof 602 with geography defined and 2 with unknown origin.
Country # Views %
  • 1
1
 
 
 
 

Cited

Latest update: 20 Jan 2021
Download
Short summary
Existing ways of modeling the flow of water amongst landscape depressions such as swamps and lakes take a long time to run. However, as our previous work explains, depressions can be quickly organized into a data structure – the depression hierarchy. This paper explains how the depression hierarchy can be used to quickly simulate the realistic filling of depressions including how they spill over into each other, and, if they become full enough, how they merge into one another.