GraphFlood 1.0: an efficient algorithm to approximate 2D hydrodynamics for Landscape Evolution Models

IF 2.8 2区 地球科学 Q2 GEOGRAPHY, PHYSICAL Earth Surface Dynamics Pub Date : 2024-05-02 DOI:10.5194/egusphere-2024-1239
Boris Gailleton, Philippe Steer, Philippe Davy, Wolfgang Schwanghart, Thomas Guillaume Adrien Bernard
{"title":"GraphFlood 1.0: an efficient algorithm to approximate 2D hydrodynamics for Landscape Evolution Models","authors":"Boris Gailleton, Philippe Steer, Philippe Davy, Wolfgang Schwanghart, Thomas Guillaume Adrien Bernard","doi":"10.5194/egusphere-2024-1239","DOIUrl":null,"url":null,"abstract":"<strong>Abstract.</strong> 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 term of spatial and temporal scales. In this conrtibution, we introduce GraphFlood, a novel and efficient iterative method for computing river depth and water discharge in 2D on a digital elevation model (DEM). Leveraging the Directed Acyclic Graph (DAG) 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 DAG 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. Iteratively, the divergence of discharges 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, with approximately a 10-fold speed-up compared to the River.lab model. Additionally, its computational time scales slightly more than linearly with the number of cells, making it suitable for large DEMs exceeding 10<sup>6</sup>–10<sup>8</sup> cells. We demonstrate the versatility of GraphFlood in 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.","PeriodicalId":48749,"journal":{"name":"Earth Surface Dynamics","volume":"31 1","pages":""},"PeriodicalIF":2.8000,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Earth Surface Dynamics","FirstCategoryId":"89","ListUrlMain":"https://doi.org/10.5194/egusphere-2024-1239","RegionNum":2,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"GEOGRAPHY, PHYSICAL","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract. 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 term of spatial and temporal scales. In this conrtibution, we introduce GraphFlood, a novel and efficient iterative method for computing river depth and water discharge in 2D on a digital elevation model (DEM). Leveraging the Directed Acyclic Graph (DAG) 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 DAG 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. Iteratively, the divergence of discharges 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, with approximately a 10-fold speed-up compared to the River.lab model. Additionally, its computational time scales slightly more than linearly with the number of cells, making it suitable for large DEMs exceeding 106–108 cells. We demonstrate the versatility of GraphFlood in 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
GraphFlood 1.0:景观演化模型近似二维流体力学的高效算法
摘要计算地球表面的水文流量对于景观演变模型、地形分析和地理信息系统至关重要。然而,现有的形式主义,如单流或多流算法,往往依赖于基于局部地形坡度和排水面积的临时规则,而忽视了水流的物理特性。虽然以物理为导向的解决方案(如浅水方程)精度更高,但其计算成本限制了其在空间和时间尺度上的应用。在本报告中,我们介绍了 GraphFlood,这是一种新颖、高效的迭代方法,用于计算数字高程模型(DEM)上的二维河流深度和排水量。利用地表水流的有向无环图(DAG)结构,GraphFlood 可以迭代求解二维浅水方程。该算法旨在通过平衡地形上的排水输入和输出,找到正确的水力表面。每次迭代时,我们都采用快速 DAG 算法计算水力面上的流量累积,近似排泄输入。然后使用曼宁流阻方程计算排泄量输出,这与 River.lab 模型类似。迭代过程中,排水量的发散会增加水流深度,直至达到静止状态。该算法还可以通过近似上游邻近地区的输入排水量函数来解决洪波传播问题。我们根据矩形河道的分析解法以及自然 DEM 的 River.lab 和 Caesar Lisflood 模型验证了静态解法获得的水深。与以前的水动力模型相比,GraphFlood 在计算方面具有显著优势,与 River.lab 模型相比,计算速度提高了约 10 倍。此外,它的计算时间与单元数的线性比例略大,因此适用于超过 106-108 个单元的大型 DEM。我们展示了 GraphFlood 在将现实水文整合到各种地形和形态分析中的多功能性,包括河道宽度测量、淹没模式划分、洪泛区划分以及山坡、冲积和河道域分类。此外,我们还讨论了它在地貌演变模型中的集成潜力,强调了它的实施简便性和计算效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Earth Surface Dynamics
Earth Surface Dynamics GEOGRAPHY, PHYSICALGEOSCIENCES, MULTIDISCI-GEOSCIENCES, MULTIDISCIPLINARY
CiteScore
5.40
自引率
5.90%
发文量
56
审稿时长
20 weeks
期刊介绍: Earth Surface Dynamics (ESurf) is an international scientific journal dedicated to the publication and discussion of high-quality research on the physical, chemical, and biological processes shaping Earth''s surface and their interactions on all scales.
期刊最新文献
Exotic tree plantations in the Chilean Coastal Range: balancing the effects of discrete disturbances, connectivity, and a persistent drought on catchment erosion Role of the forcing sources in morphodynamic modelling of an embayed beach Equilibrium distance from long-range dune interactions An empirically-derived hydraulic head model controlling water storage and outflow over a decade in degraded permafrost rock slopes (Zugspitze, D/A) Geomorphic imprint of high mountain floods: Insight from the 2022 hydrological extreme across the Upper Indus terrain in NW Himalayas
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1