Vector network analysis: Difference between revisions
Jump to navigation
Jump to search
(link to man pages) |
|||
| Line 5: | Line 5: | ||
The following algorithms are implemented: | The following algorithms are implemented: | ||
* Vector maintenance: v.net | * Vector maintenance: {{cmd|v.net}} | ||
* Shortest path: d.path and v.net.path | * Shortest path: {{cmd|d.path}} and {{cmd|v.net.path}} | ||
* Traveling salesman (round trip): v.net.salesman | * Traveling salesman (round trip): {{cmd|v.net.salesman}} | ||
* Allocation of sources (create subnetworks, e.g. police station zones): v.net.alloc | * Allocation of sources (create subnetworks, e.g. police station zones): {{cmd|v.net.alloc}} | ||
* Minimum Steiner trees (star-like connections, e.g. broadband cable connections): v.net.steiner | * Minimum Steiner trees (star-like connections, e.g. broadband cable connections): {{cmd|v.net.steiner}} | ||
* Iso-distances (from centers): v.net.iso | * Iso-distances (from centers): {{cmd|v.net.iso}} | ||
Vector directions are defined by the digitizing direction (a-->--b). Both directions are supported, network modules provide parameters to assign attribute columns to the forward and backward direction. | Vector directions are defined by the digitizing direction (a-->--b). Both directions are supported, network modules provide parameters to assign attribute columns to the forward and backward direction. | ||
* see the | * see the {{cmd|vectorintro.html}} vector map processing and network analysis] help page | ||
| Line 20: | Line 20: | ||
== Shortest path routing == | == Shortest path routing == | ||
* see the | * see the {{cmd|v.net.path}} and {{cmd|d.path}} help pages | ||
== New ideas == | == New ideas == | ||
| Line 30: | Line 30: | ||
[[Image:V.net.iso.png|center|600px|thumb| | [[Image:V.net.iso.png|center|600px|thumb|{{cmd|v.net.iso}} - Split net to bands between cost isolines (direction from centre). Costs of centre node are used in calculation.]] | ||
[[Image:V.net.alloc.png|center|600px|thumb| | [[Image:V.net.alloc.png|center|600px|thumb|{{cmd|v.net.alloc}} - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.]] | ||
[[Image:D.path.jpg|center|600px|thumb| | [[Image:D.path.jpg|center|600px|thumb|{{cmd|d.path}} - Find shortest path for selected starting and ending node.]] | ||
[[Category:Documentation]] | [[Category:Documentation]] | ||
Revision as of 17:42, 14 January 2009
Vector network analysis
GRASS provides support for vector network analysis using the DGlib Directed Graph Library.
The following algorithms are implemented:
- Vector maintenance: v.net
- Shortest path: d.path and v.net.path
- Traveling salesman (round trip): v.net.salesman
- Allocation of sources (create subnetworks, e.g. police station zones): v.net.alloc
- Minimum Steiner trees (star-like connections, e.g. broadband cable connections): v.net.steiner
- Iso-distances (from centers): v.net.iso
Vector directions are defined by the digitizing direction (a-->--b). Both directions are supported, network modules provide parameters to assign attribute columns to the forward and backward direction.
- see the vectorintro.html vector map processing and network analysis] help page
Shortest path routing
- see the v.net.path and d.path help pages
New ideas
- Vector network analysis ideas (please help to realize)
Screenshots
- more screenshots from the GRASS website
