Difference between revisions of "Vector network analysis"

From GRASS-Wiki
Jump to: navigation, search
(Screenshots)
(extended, cleanup, new ideas)
Line 1: Line 1:
= Shortest path routing and network analysis =
+
Vector network analysis
 +
GRASS provides support for vector network analysis. 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 [http://grass.ibiblio.org/grass63/manuals/html63_user/vectorintro.html vector map processing and network analysis] help page
 
* see the [http://grass.ibiblio.org/grass63/manuals/html63_user/vectorintro.html vector map processing and network analysis] help page
  
* see the [http://grass.ibiblio.org/grass63/manuals/html63_user/vector.html v.net.* module] and [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path] help pages
+
= Shortest path routing =
 +
 
 +
* see the [http://grass.ibiblio.org/grass63/manuals/html63_user/v.net.path.html v.net.path module] and [http://grass.ibiblio.org/grass63/manuals/html63_user/d.path.html d.path] help pages
  
* [[tutorial]]  ''[please add link]''
+
== New ideas ==
  
 +
* [[Vector network analysis ideas]] (please help to realize)
  
 
== Screenshots ==
 
== Screenshots ==

Revision as of 00:44, 14 September 2007

Vector network analysis GRASS provides support for vector network analysis. 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.

Shortest path routing

New ideas

Screenshots


  • v.net.iso - Split net to bands between cost isolines (direction from centre). Costs of centre node are used in calculation.

V.net.iso.png


  • v.net.alloc - Allocates subnets for nearest centres (direction from centre). Costs of centre node are used in calculation.

V.net.alloc.png


  • d.path - Find shortest path for selected starting and ending node.

D.path.jpg