Changes between Version 212 and Version 213 of Grass7/NewFeatures


Ignore:
Timestamp:
Mar 28, 2014, 2:44:17 PM (10 years ago)
Author:
neteler
Comment:

cleanup

Legend:

Unmodified
Added
Removed
Modified

  • Grass7/NewFeatures

    v212 v213  
    125125 * Large File Support (LFS) globally enabled
    126126 * G7:v.colors.out: new - Exports the color table associated with a vector map.
    127  * G7:v.generalize: new - loop support added to all smoothing algorithms
    128127 * G7:v.in.lidar: new - Converts LAS LiDAR point clouds to a GRASS vector map with libLAS.
    129128 * G7:v.out.postgis: new - Exports a vector map layer to PostGIS feature table.
    130129 * G7:v.pack: new - Packs up a vector map and support files for copying.
    131  * G7:v.to.rast: new -d flag to create densified lines (default: thin lines as in GRASS 6) for improved routing on cost surfaces
    132130 * G7:v.unpack: new - Unpacks a vector map packed with r.pack.
    133  * G7:v.voronoi: new -a flag to create Voronoi diagrams for areas.
    134131
    135132Improved:
    136133 * G7:v.colors: rewrite in C, support for vector color tables
    137  * G7:v.in.ogr faster for polygon-import, cleaner output.
     134 * G7:v.in.ogr faster for polygon-import, cleaner output
     135 * G7:v.generalize: loop support added to all smoothing algorithms
    138136 * G7:v.kernel faster by orders of magnitude (10x - 1000x)
    139137 * G7:v.mkgrid: breaks are breaks not number of segments; speedup 16x times
    140  * G7:v.net.allpairs: improved - Computes the shortest path between all pairs of nodes in the network.
    141  * G7:v.net.bridge: improved - Computes bridges and articulation points in the network.
    142  * G7:v.net.centrality: improved - Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network.
    143  * G7:v.net.components: improved - Computes strongly and weakly connected components in the network.
    144  * G7:v.net.connectivity: improved - Computes vertex connectivity between two sets of nodes in the network.
    145  * 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. 
    146  * G7:v.net.flow: improved - Computes the maximum flow between two sets of nodes in the network.
     138 * G7:v.net.allpairs: improved - Computes the shortest path between all pairs of nodes in the network
     139 * G7:v.net.bridge: improved - Computes bridges and articulation points in the network
     140 * G7:v.net.centrality: improved - Computes degree, centrality, betweeness, closeness and eigenvector centrality measures in the network
     141 * G7:v.net.components: improved - Computes strongly and weakly connected components in the network
     142 * G7:v.net.connectivity: improved - Computes vertex connectivity between two sets of nodes in the network
     143 * 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.
     144 * G7:v.net.flow: improved - Computes the maximum flow between two sets of nodes in the network
    147145 * G7:v.net: improved, it allows now to snap the points onto the network
    148  * 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.
    149  * G7:v.net.spanningtree: improved - Computes minimum spanning tree for the network.
    150  * G7:v.net.timetable: improved - Finds shortest path using timetables.
     146 * 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
     147 * G7:v.net.spanningtree: improved - Computes minimum spanning tree for the network
     148 * G7:v.net.timetable: improved - Finds shortest path using timetables
    151149 * G7:v.out.ascii: added output with column name header; all columns are selectable with "*"
    152150 * G7:v.out.ogr: multi-feature output (i.e., features with identical category are exported as multi-feature element); reversed functionality of -c flag to preserve island by default.
    153151 * G7:v.overlay: up to 40x faster for large vectors (40,000+ lines in ainput)
    154 
     152 * G7:v.to.rast: new -d flag to create densified lines (default: thin lines as in GRASS 6) for improved routing on cost surfaces
     153 * G7:v.voronoi: new -a flag to create Voronoi diagrams for areas
    155154=== 3D raster modules ===
    156155