projects: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 | ||
| projects:efficient_longest_flow_path_algorithm [2024-08-03 10:12 pm] – removed - external edit (Unknown date) 127.0.0.1 | projects:efficient_longest_flow_path_algorithm [2024-08-03 11:06 pm] (current) – ↷ Links adapted because of a move operation hcho | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | ====== Efficient longest flow path algorithm ====== | ||
| + | [[workspaces: | ||
| + | [[https:// | ||
| + | |||
| + | {{projects: | ||
| + | |||
| + | \[ | ||
| + | \def\LFP{\overrightarrow{\text{LFP}}} | ||
| + | \def\FP{\overrightarrow{\text{FP}}} | ||
| + | \def\FL{\text{FL}} | ||
| + | \def\DFL{\text{DFL}} | ||
| + | \def\UFL{\text{UFL}} | ||
| + | \def\LFL{\text{LFL}} | ||
| + | \] | ||
| + | |||
| + | A flow path $\FP_i$ is the watercourse between a pair of two points $i$ within the watershed and the longest flow path $\LFP$ is defined as | ||
| + | |||
| + | \[ | ||
| + | \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. | ||
| + | |||
| + | ===== Performance comparisons ===== | ||
| + | |||
| + | {{projects: | ||
| + | |||
| + | {{projects: | ||
| + | |||
| + | ^ Method | ||
| + | ^ 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> | ||
