Vector network analysis/pl

From GRASS-Wiki
Revision as of 10:00, 4 December 2018 by Neteler (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Narzędzia GRASS do analiz sieciowych bazują na bibliotece DGlib Directed Graph Library.

GRASS 7 has WxGUI Vector Network Analysis Tool front-end, which supports some of the vector network analysis modules.

Zaimplementowane algorytmy

Poniższe algorytmy są zaimplementowane (w GRASS 6.5+):

  • Utrzymanie sieci: v.net
  • Najkrótsza trasa: d.path and v.net.path
  • Najkrótsza trasa pomiędzy wszystkimi parami punktów: v.net.allpairs
  • Wyznaczanie podsieci (tworzenie podsieci, np. police station zones): v.net.alloc
  • Strefy jednakowych odległości (ze środków): v.net.iso
  • Obliczanie mostów i punktów artykulacji: v.net.bridge
  • Computes degree, centrality, betweeness, closeness and eigenvector centrality measures: v.net.centrality
  • Obliczanie dobrze i słabo połączonych komponentów: v.net.components
  • Obliczanie stopnia połączenia pomiędzy dwoma zestawami punktów: v.net.connectivity
  • Obliczanie najkrótszej drogi w sieci pomiędzy zadanymi zestawami obiektów: v.net.distance
  • Obliczanie maksymalnego przepływu pomiędzy dwoma zestawami punktów: v.net.flow
  • Obliczanie minimalnego drzewa rozpinającego: v.net.spanningtree
  • Minimalne drzewa Steinera (star-like connections, e.g. broadband cable connections): v.net.steiner
  • Znajdowanie najkrótszej drogi z użyciem rozkładów jazdy: v.net.timetable
  • Analizy komiwojażera (round trip): v.net.salesman

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 d.vect (set display=dir). Use Turntable to assign costs to turns on the network.

  • strona pomocy vectorintro "vector map processing and network analysis"

Przykład: Najkrótsza droga

Najważniejsze parametry

  • 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.

Nowe pomysły

Zrzuty ekranu z GRASS GIS 7

Travelling salesman (v.net.salesman)
Subsets for nearest centers (v.net.alloc)
Subsets for nearest centers (v.net.alloc)

Zobacz też

Zrzuty ekranu ze starszej wersji GRASS 5

v.net.iso - Split net to bands between cost isolines (direction from centre). 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 - Znajduje najkrótszą drogę dla wybranych początkowych i końcowych punktów.
 

See also

Linki zewnętrzne