Vector network analysis: Difference between revisions
Jump to navigation
Jump to search
m (→Screenshots) |
(→Screenshots: module desc) |
||
| Line 12: | Line 12: | ||
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.iso.html v.net.iso] | * [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.iso.html v.net.iso] - Split net to bands between cost isolines (direction from centre). Centre node must be opened (costs >= 0). Costs of centre node are used in calculation. | ||
[[Image:V.net.iso.png]] | [[Image:V.net.iso.png]] | ||
* [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.alloc.html v.net.alloc] | * [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.alloc.html v.net.alloc] - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation. | ||
[[Image:V.net.alloc.png]] | [[Image:V.net.alloc.png]] | ||
* [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path] | * [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path] - Find shortest path for selected starting and ending node. | ||
[[Image:D.path.jpg]] | [[Image:D.path.jpg]] | ||
Revision as of 08:03, 21 February 2007
Shortest path routing and network analysis
- see the vector map processing and network analysis help page
- see the v.net.* module and d.path help pages
- tutorial [please add link]
Screenshots
- more screenshots from the GRASS website
- v.net.iso - Split net to bands between cost isolines (direction from centre). Centre node must be opened (costs >= 0). Costs of centre node are used in calculation.
- v.net.alloc - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.
- d.path - Find shortest path for selected starting and ending node.
