A GPU algorithm for identifying the longest flow paths in catchments

IF 4.4 2区 地球科学 Q1 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Bartłomiej Kotyra
{"title":"A GPU algorithm for identifying the longest flow paths in catchments","authors":"Bartłomiej Kotyra","doi":"10.1016/j.cageo.2025.105961","DOIUrl":null,"url":null,"abstract":"<div><div>The longest flow path is one of the key features of a catchment, commonly considered in hydrological analysis and modeling. Recent literature highlights that identifying the longest flow paths using existing software tools is time-consuming. Over the last few years, attempts have been made to develop more computationally efficient algorithms for this particular task. This paper extends previously published research and presents a new GPU algorithm designed for fast identification of the longest flow paths using DEM-derived flow directions. Performance measurements show significantly shorter execution times compared to other existing algorithms for the same task. Additionally, this algorithm is able to efficiently process multiple catchments in the same run, offering further performance improvements.</div></div>","PeriodicalId":55221,"journal":{"name":"Computers & Geosciences","volume":"203 ","pages":"Article 105961"},"PeriodicalIF":4.4000,"publicationDate":"2025-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Geosciences","FirstCategoryId":"89","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0098300425001116","RegionNum":2,"RegionCategory":"地球科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

The longest flow path is one of the key features of a catchment, commonly considered in hydrological analysis and modeling. Recent literature highlights that identifying the longest flow paths using existing software tools is time-consuming. Over the last few years, attempts have been made to develop more computationally efficient algorithms for this particular task. This paper extends previously published research and presents a new GPU algorithm designed for fast identification of the longest flow paths using DEM-derived flow directions. Performance measurements show significantly shorter execution times compared to other existing algorithms for the same task. Additionally, this algorithm is able to efficiently process multiple catchments in the same run, offering further performance improvements.
集水区最长水流路径识别的GPU算法
最长的流道是集水区的关键特征之一,通常在水文分析和建模中被考虑。最近的文献强调,使用现有的软件工具确定最长的流程路径是非常耗时的。在过去的几年里,人们一直在尝试为这一特定任务开发更高效的计算算法。本文扩展了先前发表的研究,并提出了一种新的GPU算法,该算法旨在使用dem衍生的流动方向快速识别最长的流动路径。性能测量显示,对于相同的任务,与其他现有算法相比,执行时间明显缩短。此外,该算法能够在同一次运行中有效地处理多个集水区,从而进一步提高性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Geosciences
Computers & Geosciences 地学-地球科学综合
CiteScore
9.30
自引率
6.80%
发文量
164
审稿时长
3.4 months
期刊介绍: Computers & Geosciences publishes high impact, original research at the interface between Computer Sciences and Geosciences. Publications should apply modern computer science paradigms, whether computational or informatics-based, to address problems in the geosciences.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信