Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
calc_cost_map [2012/03/14 21:17] hermann [Optional Inputs] |
calc_cost_map [2012/03/14 21:21] hermann |
||
|---|---|---|---|
| Line 15: | Line 15: | ||
| ^ Name ^ Type ^ Description ^ Default Value ^ | ^ Name ^ Type ^ Description ^ Default Value ^ | ||
| | Cell Type | [[Cell Type Type | Cell Type]] | Data cell type of the cost map must be compatible to the source feature and friction data cell types, otherwise an error will be reported. | Signed 32 Bit Integer | | | Cell Type | [[Cell Type Type | Cell Type]] | Data cell type of the cost map must be compatible to the source feature and friction data cell types, otherwise an error will be reported. | Signed 32 Bit Integer | | ||
| - | | Null Value | [[Null Value Type | Null Value]] | Null value of the cost map. This value cannot be equal to zero because zero value represents source features on the cost map. If it is set to zero, an error will be reported. | Default((Based on the given cell type)) | | + | | Null Value | [[Null Value Type | Null Value]] | Null value of the cost map. This value cannot be equal to zero because zero value represents source features on the cost map. If it is set to zero, an error will be reported. | Default((Based on the value of the Cell Type input.)) | |
| | Diagonals Cost More | [[Bool Type | Bool]] | If true, diagonal movements are more expensive than orthogonal movements (horizontal / vertical). In this case, the cost of a diagonal movement is multiplied by 1.414213562. | True | | | Diagonals Cost More | [[Bool Type | Bool]] | If true, diagonal movements are more expensive than orthogonal movements (horizontal / vertical). In this case, the cost of a diagonal movement is multiplied by 1.414213562. | True | | ||
| | Maximum Number Of Passes | [[Non Negative Int Type | Non Negative Int]] | Maximum number of passes that are used to calculate the cost map. The value 0 (zero) indicates that this functor will execute as many steps as needed in order to produce the best cost (optimized) map. Usually two passes are enough to produce optimized cost maps. | 0 | | | Maximum Number Of Passes | [[Non Negative Int Type | Non Negative Int]] | Maximum number of passes that are used to calculate the cost map. The value 0 (zero) indicates that this functor will execute as many steps as needed in order to produce the best cost (optimized) map. Usually two passes are enough to produce optimized cost maps. | 0 | | ||
| Line 51: | Line 51: | ||
| CalcCostMap | CalcCostMap | ||
| - | |||