Commit a61e006
authored
* Add least-cost corridor function (#965)
Computes corridors of low cumulative cost between source locations
by summing two cost-distance surfaces and normalizing. Supports
absolute and relative thresholding, pre-computed cost-distance
inputs, and multi-source pairwise corridors.
* Add tests for least_cost_corridor (#965)
Covers symmetry, optimal path minimum, absolute and relative
thresholding, precomputed surfaces, multi-source pairwise,
barriers, unreachable sources, single-cell input, and input
validation. All parametrized across numpy and dask+numpy backends.
* Add corridor docs, user guide notebook, and README entry (#965)
Adds API reference entry under Proximity, a user guide notebook
(20_Corridor_Analysis) covering all major features, and a row
in the README feature matrix.
1 parent 7cad73b commit a61e006
File tree
6 files changed
+1029
-0
lines changed- docs/source/reference
- examples/user_guide
- xrspatial
- tests
6 files changed
+1029
-0
lines changed| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
241 | 241 | | |
242 | 242 | | |
243 | 243 | | |
| 244 | + | |
244 | 245 | | |
245 | 246 | | |
246 | 247 | | |
| |||
| Original file line number | Diff line number | Diff line change | |
|---|---|---|---|
| |||
35 | 35 | | |
36 | 36 | | |
37 | 37 | | |
| 38 | + | |
| 39 | + | |
| 40 | + | |
| 41 | + | |
| 42 | + | |
| 43 | + | |
| 44 | + | |
38 | 45 | | |
39 | 46 | | |
40 | 47 | | |
| |||
0 commit comments