efficient_longest_flow_path_algorithm
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revision | |||
| efficient_longest_flow_path_algorithm [2020-08-07 12:38 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 15: | Line 15: | ||
| 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 | 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 | ||
| - | \begin{equation} | + | \[ |
| \LFP\in\left\{\FP_i\;: | \LFP\in\left\{\FP_i\;: | ||
| - | \end{equation} | + | \] |
| - | \text | + | |
| 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. | ||
efficient_longest_flow_path_algorithm.1596825509.txt.gz · Last modified: 2020-08-07 12:38 pm by hcho