کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
11032443 | 1645586 | 2018 | 31 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new rapid watershed delineation algorithm for 2D flow direction grids
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نرم افزار
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
In this paper we propose an algorithm for retrieving an arbitrary watershed boundary from a 2D Flow Direction Grid. The proposed algorithm and associated data model provides geometric speed increases in watershed boundary retrieval while keeping storage constraints linear in comparison to existing techniques. The algorithm called Watershed Marching Algorithm (WMA) relies on an existing data structure, the modified nested set model, originally described by Celko and applied to hydrodynamic models by Haag and Shokoufandeh in 2017. In contrast to existing algorithms that scale proportionally to the area of the underlying region, the complexity of the WMA algorithm is proportional to the boundary length. Results for a group of tested watersheds (nâ¯=â¯14,718) in the â 36,000â¯km2 Delaware River Watershed show a reduction of between 0 and 99% in computational complexity using a 30â¯m DEM vs. existing techniques.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Environmental Modelling & Software - Volume 109, November 2018, Pages 420-428
Journal: Environmental Modelling & Software - Volume 109, November 2018, Pages 420-428
نویسندگان
Scott Haag, Bahareh Shakibajahromi, Ali Shokoufandeh,