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.


Browse other questions tagged or ask your own question.