Changes between Version 164 and Version 165 of Grass7/NewFeatures

Timestamp:

06/20/13 04:13:25 (11 years ago)

Author:

borohoro

Comment:

--

Grass7/NewFeatures

@@ -99 +99 @@
 
  * Large File Support (LFS) globally enabled
- * G7:v.colors.out: new
+ * G7:v.colors.out: new - Exports the color table associated with a vector map. 
  * G7:v.colors: rewrite in C, support for vector color tables
  * G7:v.generalize: loop support added to all smoothing algorithms
- * G7:v.in.lidar: new
+ * G7:v.in.lidar: new - Converts LAS LiDAR point clouds to a GRASS vector map with libLAS. 
  * G7:v.in.ogr faster for polygon-import, cleaner output.
  * G7:v.kernel faster by orders of magnitude (10x - 1000x)
  * G7:v.krige: new
  * G7:v.mkgrid: breaks are breaks not number of segments; speedup 16x times
- * G7:v.net.allpairs: improved
- * G7:v.net.bridge: improved
- * G7:v.net.centrality: improved
- * G7:v.net.components: improved
- * G7:v.net.connectivity: improved
- * G7:v.net.distance: improved
- * G7:v.net.flow: improved
+ * G7:v.net.allpairs: improved - Computes the shortest path between all pairs of nodes in the network. 
+ * G7:v.net.bridge: improved - Computes bridges and articulation points in the network. 
+ * G7:v.net.centrality: improved - Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.
+ * G7:v.net.components: improved - Computes strongly and weakly connected components in the network. 
+ * G7:v.net.connectivity: improved - Computes vertex connectivity between two sets of nodes in the network. 
+ * G7:v.net.distance: improved - Computes shortest distance via the network between the given sets of features. Finds the shortest paths from each 'from' point to the nearest 'to' feature and various information about this relation are uploaded to the attribute table. 
+ * G7:v.net.flow: improved - Computes the maximum flow between two sets of nodes in the network. 
  * G7:v.net: improved, it allows now to snap the points onto the network
  * G7:v.net.salesman: optional tour optimization added. The standard algorithm to find the shortest tour is heuristic and often does not find the optimal tour for more than 10 nodes to visit. The optimization methods available are bootstrapping and a genetic algorithm.
- * G7:v.net.spanningtree: improved
- * G7:v.net.timetable: improved
+ * G7:v.net.spanningtree: improved - Computes minimum spanning tree for the network. 
+ * G7:v.net.timetable: improved - Finds shortest path using timetables. 
  * G7:v.out.ogr: reversed functionality of -c flag to preserve island by default.
- * G7:v.out.postgis: new
+ * G7:v.out.postgis: new - Exports a vector map layer to PostGIS feature table. 
  * G7:v.overlay: up to 40x faster for large vectors (40,000+ lines in ainput)
- * G7:v.pack: new
+ * G7:v.pack: new - Packs up a vector map and support files for copying. 
  * G7:v.to.rast: new -d flag to create densified lines (default: thin lines as in GRASS 6) for improved routing on cost surfaces
- * G7:v.unpack: new
+ * G7:v.unpack: new - Unpacks a vector map packed with r.pack. 
 
 === 3D raster modules ===