Journal cover Journal topic
Earth Surface Dynamics An interactive open-access journal of the European Geosciences Union
Journal topic

Journal metrics

Journal metrics

  • IF value: 3.176 IF 3.176
  • IF 5-year value: 3.108 IF 5-year
    3.108
  • CiteScore value: 3.06 CiteScore
    3.06
  • SNIP value: 0.978 SNIP 0.978
  • SJR value: 1.421 SJR 1.421
  • IPP value: 2.88 IPP 2.88
  • h5-index value: 13 h5-index 13
  • Scimago H <br class='hide-on-tablet hide-on-mobile'>index value: 13 Scimago H
    index 13
Discussion papers
https://doi.org/10.5194/esurf-2018-81
© Author(s) 2018. This work is distributed under
the Creative Commons Attribution 4.0 License.
https://doi.org/10.5194/esurf-2018-81
© Author(s) 2018. This work is distributed under
the Creative Commons Attribution 4.0 License.

Research article 10 Dec 2018

Research article | 10 Dec 2018

Review status
This discussion paper is a preprint. A revision of the manuscript was accepted for the journal Earth Surface Dynamics (ESurf).

A Versatile, Linear Complexity Algorithm for Flow Routing in Topographies with Depressions

Guillaume Cordonnier1,2, Benoît Bovy3, and Jean Braun3 Guillaume Cordonnier et al.
  • 1Univ. Grenoble Alpes, 1251 Avenue Centrale Domaine Universitaire, 38400 Saint-Martin-d'Hères, France
  • 2Inria Grenoble Rhône-Alpes, 655 Avenue de l'Europe, 38330 Montbonnot-Saint-Martin, France
  • 3GFZ German Research Centre for Geosciences, Telegrafenberg 14473, Potsdam, Germany

Abstract. We present a new algorithm for solving the common problem of flow trapped in closed depressions within digital elevation models, as encountered in many applications relying on flow routing. Unlike other approaches (e.g., the so-called Priority-Flood depression filling algorithm), this solution is based on the explicit computation of the flow paths both within and across the depressions through the construction of a graph connecting together all adjacent drainage basins. Although this represents many operations, a linear time-complexity can be reached for the whole computation, making it very efficient. Compared to the most optimized solutions proposed so far, we show that this algorithm of flow path enforcement yields the best performance when used in landscape evolution models. Besides its efficiency, our proposed method has also the advantage of letting the user choose among different strategies of flow path enforcement within the depressions (i.e., filling vs. carving). Furthermore, the computed graph of basins is a generic structure that has the potential to be reused for solving other problems as well. This sequential algorithm may be helpful for those who need to, e.g., process digital elevation models of moderate size on single computers or run batches of simulations as part of an inference study.

Guillaume Cordonnier et al.
Interactive discussion
Status: final response (author comments only)
Status: final response (author comments only)
AC: Author comment | RC: Referee comment | SC: Short comment | EC: Editor comment
Guillaume Cordonnier et al.
Guillaume Cordonnier et al.
Viewed  
Total article views: 589 (including HTML, PDF, and XML)
HTML PDF XML Total BibTeX EndNote
484 99 6 589 7 8
  • HTML: 484
  • PDF: 99
  • XML: 6
  • Total: 589
  • BibTeX: 7
  • EndNote: 8
Views and downloads (calculated since 10 Dec 2018)
Cumulative views and downloads (calculated since 10 Dec 2018)
Viewed (geographical distribution)  
Total article views: 360 (including HTML, PDF, and XML) Thereof 359 with geography defined and 1 with unknown origin.
Country # Views %
  • 1
1
 
 
 
 
Cited  
Saved  
No saved metrics found.
Discussed  
No discussed metrics found.
Latest update: 22 May 2019
Publications Copernicus
Download
Short summary
We propose a new algorithm to solve the problem of flow routing across local depressions in the topography, one of the main computational bottlenecks in landscape evolution models. Our solution is more efficient than the state-of-the-art, with an optimal linear asymptotic complexity. The algorithm has been designed specifically to be used within landscape evolution models, and also suits more generally the efficient treatment of large digital elevation models.
We propose a new algorithm to solve the problem of flow routing across local depressions in the...
Citation