efficient_longest_flow_path_algorithm
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
efficient_longest_flow_path_algorithm [2020-01-07 05:12 pm] – hcho | efficient_longest_flow_path_algorithm [2020-08-07 12:40 pm] (current) – old revision restored (2020-07-05 08:39 pm) hcho | ||
---|---|---|---|
Line 1: | Line 1: | ||
====== Efficient longest flow path algorithm ====== | ====== Efficient longest flow path algorithm ====== | ||
+ | [[Efficient longest flow path algorithm: | ||
{{: | {{: | ||
Line 12: | Line 13: | ||
\] | \] | ||
- | A flow path $\FP_i$ is a watercourse between a pair of two points $i$ within | + | A flow path $\FP_i$ is the watercourse between a pair of two points $i$ within |
\[ | \[ | ||
- | \LFP\in\left\{\FP_i\; | + | \LFP\in\left\{\FP_i\; |
\] | \] | ||
The longest flow path plays an important role in hydrologic modeling, but its computation requires multi-step raster calculations for each watershed. This research project aims to improve the current process and efficiency of computing the longest flow path for a lot of watersheds. | The longest flow path plays an important role in hydrologic modeling, but its computation requires multi-step raster calculations for each watershed. This research project aims to improve the current process and efficiency of computing the longest flow path for a lot of watersheds. | ||
+ | |||
+ | ===== Performance comparisons ===== | ||
+ | |||
+ | {{: | ||
{{: | {{: | ||
- | ^ Method | + | ^ Method |
^ Elapsed time | 3h 48m | ^ Elapsed time | 3h 48m | ||
+ | |||
+ | ===== References ===== | ||
+ | |||
+ | * Huidae Cho, July 2020 in Press. //__A recursive algorithm for calculating the longest flow path and its iterative implementation.__// | ||
+ | * [[https:// | ||
+ | |||
+ | {{tag> |
efficient_longest_flow_path_algorithm.1578442342.txt.gz · Last modified: 2020-01-07 05:12 pm by hcho