Logo image
Back
A new rapid watershed delineation algorithm for 2D flow direction grids
Journal article   Peer reviewed

A new rapid watershed delineation algorithm for 2D flow direction grids

Scott Haag, Bahareh Shakibajahromi and Ali Shokoufandeh
Environmental modelling & software : with environment data news, v 109, pp 420-428
Nov 2018
DOI: https://doi.org/10.1016/j.envsoft.2018.08.017
Featured in Collection :   UN Sustainable Development Goals @ Drexel

Abstract

Graph theory Modified nested set algorithm Watershed boundaries Watershed marching algorithm (WMA) algorithm
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.

Metrics

13 Record Views
12 citations in Web of Science
12 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#13 Climate Action

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Interdisciplinary Applications
Engineering, Environmental
Environmental Sciences
Water Resources
Logo image