GraphFlood 1.0: an efficient algorithm to approximate 2D hydrodynamics for landscape evolution models - Observatoire des Sciences de l'Univers de Rennes
Article Dans Une Revue (Article De Synthèse) Earth Surface Dynamics Année : 2024

GraphFlood 1.0: an efficient algorithm to approximate 2D hydrodynamics for landscape evolution models

Boris Gailleton
  • Fonction : Auteur correspondant
  • PersonId : 1471758

Connectez-vous pour contacter l'auteur
Philippe Steer
Philippe Davy

Résumé

Computing hydrological fluxes at the Earth's surface is crucial for landscape evolution models, topographic analysis, and geographic information systems. However, existing formalisms, like single or multiple flow algorithms, often rely on ad hoc rules based on local topographic slope and drainage area, neglecting the physics of water flow. While more physics-oriented solutions offer accuracy (e.g. shallow-water equations), their computational costs limit their use in terms of spatial and temporal scales. In this contribution, we introduce Graph-Flood, a novel and efficient iterative method for computing river depth and water discharge in 2D with a digital elevation model (DEM). Leveraging the directed acyclic graph structure of surface water flow, GraphFlood iteratively solves the 2D shallow-water equations. This algorithm aims to find the correct hydraulic surface by balancing discharge input and output over the topography. At each iteration, we employ fast-graph-theory algorithms to calculate flow accumulation on the hydraulic surface, approximating discharge input. Discharge output is then computed using the Manning flow resistance equation, similar to the River.lab model (Davy and Lague, 2009). The divergence of discharges iteratively increments flow depth until reaching a stationary state. This algorithm can also solve for flood wave propagation by approximating the input discharge function of the immediate upstream neighbours. We validate water depths obtained with the stationary solution against analytical solutions for rectangular channels and the River.lab and CAESAR-Lisflood models for natural DEMs. GraphFlood demonstrates significant computational advantages over previous hydrodynamic models, an with approximately 10-fold speed-up compared to the River.lab model (Davy and Lague, 2009). Additionally, its computational time scales slightly more than linearly with the number of cells, making it suitable for large DEMs exceeding 10 6 -10 8 cells. We demonstrate the versatility of GraphFlood by integrating realistic hydrology into various topographic and morphometric analyses, including channel width measurement, inundation pattern delineation, floodplain delineation, and the classification of hillslope, colluvial, and fluvial domains. Furthermore, we discuss its integration potential in landscape evolution models, highlighting its simplicity of implementation and computational efficiency.
Fichier principal
Vignette du fichier
esurf-12-1295-2024.pdf (9.57 Mo) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
licence

Dates et versions

insu-04822581 , version 1 (06-12-2024)

Licence

Identifiants

Citer

Boris Gailleton, Philippe Steer, Philippe Davy, Wolfgang Schwanghart, Thomas Bernard. GraphFlood 1.0: an efficient algorithm to approximate 2D hydrodynamics for landscape evolution models. Earth Surface Dynamics, 2024, 12 (6), pp.1295 - 1313. ⟨10.5194/esurf-12-1295-2024⟩. ⟨insu-04822581⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More