Conference proceeding
A fast algorithm to retrieve a watershed boundary for any simple geometric object
American Geophysical Union Fall Meeting, Vol.2019
Dec 2019
Abstract
In this presentation, we describe a data structure and associated algorithm to retrieve a watershed boundary for any arbitrary simple geometry (points, lines or polygons). Our proposed method builds upon our earlier research on methods to retrieve watershed boundaries using marching algorithms. We have shown that marching algorithms, when applied to the watershed delineation problem, provide a geometric reduction in computational complexity in comparison to existing techniques, running in seconds vs hours or days on standard desktop computers. Most watershed retrieval algorithms (e.g., TAUDEM or ESRI Hydrologic tools) focus on returning results based on single basin drainage locations. The novel method described in this presentation will allow users to delineate watersheds for several uses including evaluating best management practices (BMP's), measuring water impacts to municipal, city and parcel boundaries and others. Lastly, we demonstrate a working example of the watershed algorithm using an Application Programming Interface (API) that returns watershed boundaries for any simple geometric object.
Metrics
4 Record Views
Details
- Title
- A fast algorithm to retrieve a watershed boundary for any simple geometric object
- Creators
- Scott Haag - Drexel UniversityAli ShokoufandehMike CampagnaAnonymous
- Publication Details
- American Geophysical Union Fall Meeting, Vol.2019
- Conference
- American Geophysical Union Fall Meeting (2019)
- Publisher
- American Geophysical Union
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Computer Science (Computing); Center for Environmental Policy
- Identifiers
- 991019203741604721