Vector network analysis: Difference between revisions
Jump to navigation
Jump to search
m (toc cosmetics) |
(+v.net.visibility) |
||
| (11 intermediate revisions by 3 users not shown) | |||
| Line 1: | Line 1: | ||
GRASS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library. | GRASS GIS provides support for vector network analysis using the [http://trac.osgeo.org/grass/browser/grass/trunk/lib/vector/dglib/ DGlib] Directed Graph Library. | ||
GRASS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules. | GRASS GIS 7 has [[WxGUI Vector Network Analysis Tool]] front-end, which supports some of the vector network analysis modules. | ||
__TOC__ | __TOC__ | ||
== Implemented algorithms == | == Implemented algorithms == | ||
The following algorithms | The following algorithms have been implemented: | ||
* Vector maintenance: {{cmd|v.net | * Vector maintenance: {{cmd|v.net}} | ||
* Shortest path: | * Shortest path: {{cmd|v.net.path}} | ||
* Shortest path between all pairs of nodes {{cmd|v.net.allpairs | * Shortest path between all pairs of nodes {{cmd|v.net.allpairs}} | ||
* Allocation of sources (create subnetworks, e.g. police station zones): {{cmd|v.net.alloc | * Allocation of sources (create subnetworks, e.g. police station zones): {{cmd|v.net.alloc}} | ||
* Iso-distances (from centers): {{cmd|v.net.iso | * Iso-distances (from centers): {{cmd|v.net.iso}} | ||
* Computes bridges and articulation points: {{cmd|v.net.bridge | * Computes bridges and articulation points: {{cmd|v.net.bridge}} | ||
* Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd|v.net.centrality | * Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: {{cmd|v.net.centrality}} | ||
* Computes strongly and weakly connected components: {{cmd|v.net.components | * Computes strongly and weakly connected components: {{cmd|v.net.components}} | ||
* Computes vertex connectivity between two sets of nodes: {{cmd|v.net.connectivity | * Computes vertex connectivity between two sets of nodes: {{cmd|v.net.connectivity}} | ||
* Computes shortest distance via the network between the given sets of features: {{cmd|v.net.distance | * Computes shortest distance via the network between the given sets of features: {{cmd|v.net.distance}} | ||
* Computes the maximum flow between two sets of nodes: {{cmd|v.net.flow | * Computes the maximum flow between two sets of nodes: {{cmd|v.net.flow}} | ||
* Computes minimum spanning tree: {{cmd|v.net.spanningtree | * Computes minimum spanning tree: {{cmd|v.net.spanningtree}} | ||
* Minimum Steiner trees (star-like connections, e.g. broadband cable connections): {{cmd|v.net.steiner | * Minimum Steiner trees (star-like connections, e.g. broadband cable connections): {{cmd|v.net.steiner}} | ||
* Finds shortest path using timetables: {{cmd|v.net.timetable | * Finds shortest path using timetables: {{cmd|v.net.timetable}} | ||
* Traveling salesman (round trip): {{cmd|v.net.salesman| | * Traveling salesman (round trip): {{cmd|v.net.salesman}} | ||
* Performs visibility graph construction: {{cmd|v.net.visibility}} | |||
Vector directions are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd|d.vect}} (set display=dir). | Vector directions (directed graph) are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of {{cmd|d.vect}} (set display=dir). | ||
Use [[Turntable]] to assign costs to turns on the network. | |||
* see the {{cmd|vectorintro | * see the {{cmd|vectorintro|desc=vector map processing and network analysis}} help page | ||
== Example: Shortest path routing == | == Example: Shortest path routing == | ||
| Line 51: | Line 52: | ||
If you are not familiar with layers concept in GRASS see [[Vector Database Management]]. | If you are not familiar with layers concept in GRASS see [[Vector Database Management]]. | ||
== New ideas == | == New ideas == | ||
| Line 61: | Line 58: | ||
== Screenshots == | == Screenshots == | ||
=== GRASS GIS 7 screenshots === | |||
[[Image: | [[Image:Grass7_vector_network_tool_salesman.png|center|600px|thumb|Travelling salesman ({{cmd|v.net.salesman}})]] | ||
[[Image:Grass7_vector_network_tool_alloc.png|center|600px|thumb|Subsets for nearest centers ({{cmd|v.net.alloc}})]] | |||
[[Image: | [[Image:wxgui-vnet-alloc.png|center|600px|thumb|Subsets for nearest centers ({{cmd|v.net.alloc}})]] | ||
See also | |||
* [[WxGUI Vector Network Analysis Tool]] | |||
* more screenshots [https://grass.osgeo.org/screenshots/vector/ from the GRASS website] | |||
[[Image:D.path.jpg|center| | === Old GRASS 5 screenshots === | ||
<center> | |||
{| | |||
| [[Image:V.net.iso.png|center|400px|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|400px|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|400px|thumb|{{cmd|d.path}} - Find shortest path for selected starting and ending node.]] | |||
| | |||
|} | |||
</center> | |||
== See also == | == See also == | ||
* [[Turntable]] | |||
* [[GSoC Network Analysis]]: many new modules! | * [[GSoC Network Analysis]]: many new modules! | ||
| Line 79: | Line 91: | ||
* [http://www.ing.unitn.it/~grass/docs/tutorial_64_en/htdocs/esercitazione/network_analysis/index.html Network analysis tutorial] by University of Trento, Italy | * [http://www.ing.unitn.it/~grass/docs/tutorial_64_en/htdocs/esercitazione/network_analysis/index.html Network analysis tutorial] by University of Trento, Italy | ||
== External links == | == External links == | ||
| Line 86: | Line 97: | ||
[[Category:Documentation]] | [[Category:Documentation]] | ||
[[Category:FAQ]] | |||
[[Category:Vector]] | [[Category:Vector]] | ||
[[Category:Network Analysis]] | |||
Latest revision as of 12:21, 28 February 2019
GRASS GIS provides support for vector network analysis using the DGlib Directed Graph Library.
GRASS GIS 7 has WxGUI Vector Network Analysis Tool front-end, which supports some of the vector network analysis modules.
Implemented algorithms
The following algorithms have been implemented:
- Vector maintenance: v.net
- Shortest path: v.net.path
- Shortest path between all pairs of nodes v.net.allpairs
- Allocation of sources (create subnetworks, e.g. police station zones): v.net.alloc
- Iso-distances (from centers): v.net.iso
- Computes bridges and articulation points: v.net.bridge
- Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: v.net.centrality
- Computes strongly and weakly connected components: v.net.components
- Computes vertex connectivity between two sets of nodes: v.net.connectivity
- Computes shortest distance via the network between the given sets of features: v.net.distance
- Computes the maximum flow between two sets of nodes: v.net.flow
- Computes minimum spanning tree: v.net.spanningtree
- Minimum Steiner trees (star-like connections, e.g. broadband cable connections): v.net.steiner
- Finds shortest path using timetables: v.net.timetable
- Traveling salesman (round trip): v.net.salesman
- Performs visibility graph construction: v.net.visibility
Vector directions (directed graph) are defined by the digitizing direction (a-->--b). You can navigate either omnidirectionally or differently in each directions as both directions are supported. Network modules provide parameters to assign attribute columns to the forward and backward direction. To see how a vector is directed, use the "display" parameter of d.vect (set display=dir). Use Turntable to assign costs to turns on the network.
- see the vector map processing and network analysis help page
Example: Shortest path routing
- see the v.net.path and d.path help pages
Common parameters
- input - This is the name of input vector map or data source for direct OGR access.
- output - This is the name for output vector map.
- type - This parameter defines arc type, which can be line or boundary.
- alayer - This parameter is a number and defines the arc layer. Vector features can have category values in different layers. This number determines which layer to use. When used with direct OGR access this is the layer name.
- nlayer - This parameter is a number and defines the node layer. Vector features can have category values in different layers. This number determines which layer to use. When used with direct OGR access this is the layer name.
- afcolumn - This is name of the cost column for moving in forward direction or forward and backward directions together.
- abcolumn - This is name of the cost column for moving in backward direction.
- ncolumn - This is name of the cost column for moving through nodes.
If you are not familiar with layers concept in GRASS see Vector Database Management.
New ideas
- Vector network analysis ideas (please help to realize)
Screenshots
GRASS GIS 7 screenshots
See also
- WxGUI Vector Network Analysis Tool
- more screenshots from the GRASS website
Old GRASS 5 screenshots
 |
 |
 |
See also
- Turntable
- GSoC Network Analysis: many new modules!
Tutorials
- Network analysis tutorial by University of Trento, Italy