A fast algorithm to delineate watershed boundaries for simple geometries. (December 2020)

• Record Type: Journal Article
• Authors: Haag, Scott; Schwartz, Daniel; Shakibajahromi, Bahareh; Campagna, Michael; Shokoufandeh, Ali
• Is Part Of: Environmental modelling & software. Volume 134(2020)
• Publication Date: 2020-12
• Subjects: Watershed boundary -- Marching algorithm -- Modified nested set algorithm -- Constrained watershed boundary; Environmental monitoring -- Computer programs -- Periodicals; Ecology -- Computer simulation -- Periodicals; Digital computer simulation -- Periodicals; Computer software -- Periodicals; Environmental Monitoring -- Periodicals; Computer Simulation -- Periodicals; Environnement -- Surveillance -- Logiciels -- Périodiques; Écologie -- Simulation, Méthodes de -- Périodiques; Simulation par ordinateur -- Périodiques; Logiciels -- Périodiques; Computer software; Digital computer simulation; Ecology -- Computer simulation; Environmental monitoring -- Computer programs; Periodicals; Electronic journals; 363.70015118
• DOI: 10.1016/j.envsoft.2020.104842
• Languages: English
• ISSNs: 1364-8152

Abstract

Abstract: 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. Highlights: 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.