Logo image
A fast algorithm to delineate watershed boundaries for simple geometries
Journal article   Peer reviewed

A fast algorithm to delineate watershed boundaries for simple geometries

Scott Haag, Daniel Schwartz, Bahareh Shakibajahromi, Michael Campagna and Ali Shokoufandeh
Environmental modelling & software : with environment data news, v 134, 104842
Dec 2020

Abstract

Constrained watershed boundary Marching algorithm Modified nested set algorithm Watershed boundary
In this manuscript, we describe a computational model to delineate watershed boundaries for simple geometries (points, lines or polygons) where maximum water flow distance can be constrained by a user-defined variable. This method generalizes earlier research to delineate watershed boundaries using a marching algorithm. Our proposed method allows users to delineate watersheds for a number of use-cases including evaluating best management practices (BMP's), measuring water impacts to municipal, city and parcel boundaries and others. We describe computational complexity and space costs and compare them experimentally to standard techniques. •We present an algorithm that returns watershed boundaries for any single geometric object given a Digital Elevation Model.•Empirical tests show that this method is 500 times faster than existing techniques.•We present a variation of this algorithm that returns a constrained watershed based on a maximum water flow distance.

Metrics

19 Record Views
11 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:

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