I'm curious about the complexity, in terms of Big or little O notation, of watershed delineation algorithms that are implemented in ArcGIS. I imagine that these will be dependent on either the size of the input raster or on the size of the basin being delineated, but I am not sure.
Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. It only takes a minute to sign up.
Sign up to join this community
Anybody can ask a question
Anybody can answer
The best answers are voted up and rise to the top
