You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardexpand all lines: raster/r.cost/r.cost.md
+6-2
Original file line number
Diff line number
Diff line change
@@ -76,7 +76,9 @@ also considered.
76
76
Knight's move example:
77
77
78
78

79
-
*Flat cost surface without (left pane) and with the knight's move (right pane). The default is to grow the cost outwards in 8 directions. Using the knight's move grows it outwards in 16 directions.*
79
+
*Flat cost surface without (left pane) and with the knight's move (right pane).
80
+
The default is to grow the cost outwards in 8 directions.
81
+
Using the knight's move grows it outwards in 16 directions.*
80
82
81
83
If the **nearest** output parameter is specified, the module will
82
84
calculate for each cell its nearest starting point based on the
@@ -93,7 +95,9 @@ option to help the algorithm pick a particular direction.
93
95
Example for solving multiple directions:
94
96
95
97

96
-
*A field of equal cumulative costs with multiple paths (black). By default a path along the edge will be selected (red). Path selection can be controlled with the solver option (blue).*
98
+
*A field of equal cumulative costs with multiple paths (black).
99
+
By default a path along the edge will be selected (red).
100
+
Path selection can be controlled with the solver option (blue).*
97
101
98
102
Multiple directions can be solved as in the above example with the
1. The [TerraFlow](http://www.cs.duke.edu/geo*/terraflow/) project at Duke University
169
-
2.[I/O-efficient algorithms for problems on grid-based
170
-
terrains](http://www.cs.duke.edu/geo*/terraflow/papers/alenex00_drainage.ps.gz). Lars Arge, Laura Toma, and Jeffrey S. Vitter. In
168
+
1.[I/O-efficient algorithms for problems on grid-based terrains](https://dl.acm.org/doi/10.1145/945394.945395).
169
+
Lars Arge, Laura Toma, and Jeffrey S. Vitter. In
171
170
*Proc. Workshop on Algorithm Engineering and Experimentation*, 2000.
172
171
To appear in *Journal of Experimental Algorithms*.
173
-
3.[Flow computation on massive grids](http://www.cs.duke.edu/geo*/terraflow/papers/acmgis01_terraflow.pdf). Lars
174
-
Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura Toma, Jeffrey S.
172
+
2.[Flow computation on massive grids](https://dl.acm.org/doi/10.1145/512161.512180).
173
+
Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura Toma, Jeffrey S.
175
174
Vitter, Dean Urban and Rajiv Wickremesinghe. In *Proc. ACM Symposium
176
175
on Advances in Geographic Information Systems*, 2001.
177
-
4.[Flow computation on massive grid terrains](http://www.cs.duke.edu/geo*/terraflow/papers/journal_terraflow.pdf). Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura
176
+
3.[Flow computation on massive grid terrain datasets](https://link.springer.com/article/10.1023/A:1025526421410).
177
+
Lars Arge, Jeffrey S. Chase, Patrick N. Halpin, Laura
178
178
Toma, Jeffrey S. Vitter, Dean Urban and Rajiv Wickremesinghe. In
179
179
*GeoInformatica, International Journal on Advances of Computer
180
180
Science for Geographic Information Systems*, 7(4):283-313, December

168
-
*A series of points, spaced every 10% of the line's length along the tracks from the end of the line up to the middle point, offset 500m to the right*
167
+

169
+
*A series of points, spaced every 10% of the line's length along the tracks
170
+
from the end of the line up to the middle point, offset 500m to the right*
0 commit comments