DESCRIPTION

v.generalise is a module for the generalization of GRASS vector maps. This module consists of algorithms for line simplification, line smoothing, network generalization and displacement (new methods may be added later). For more examples and nice pictures, see tutorial

NOTES

(Line) simplification is a process of reducing the complexity of vector features. The module transforms a line into another line consisting of fewer vertices, that still approximate the original line. Most of the algorithms described below select a subset of points on the original line.

(Line) smoothing is a "reverse" process which takes as input a line and produces a smoother approximate of the original. In some cases, this is achieved by inserting new vertices into the original line, and can total up to 4000% of the number of vertices in the original. In such an instance, it is always a good idea to simplify the line after smoothing.

Smoothing and simplification algorithms implemented in this module work line by line, i.e. simplification/smoothing of one line does not affect the other lines; they are treated separately. Also, the first and the last point of each line is never translated and/or deleted.

SIMPLIFICATION

v.generalise contains following line simplification algorithms: Different algorithms require different parameters, but all the algorithms have one parameter in common: the threshold parameter. In general, the degree of simplification increases with the increasing value of threshold.
If the -r flag is passed, simplified lines that become shorter becomes shorter than the threshold value are removed. Additionally, if the type parameter contains area and a simplification algorithm is selected, then areas less than threshold are also removed.

ALGORITHM DESCRIPTIONS

Douglas-Peucker and Douglas-Peucker Reduction Algorithm use the same method to simplify the lines. Note that 
v.generalise input=in output=out method=douglas threshold=eps
is equivalent to 
v.generalise input=in output=out method=douglas_reduction threshold=eps reduction=100
However, in this case, the first method is faster. Also observe that douglas_reduction never outputs more vertices than douglas. And that, in general, douglas is more efficient than douglas_reduction. More importantly, the effect of 
v.generalise input=in output=out method=douglas_reduction threshold=0 reduction=X
is that 'out' contains approximately only X% of points of 'in'.

SMOOTHING

The following smoothing algorithms are implemented in v.generalise One of the key advantages of Hermite Interpolation is the fact that the computed line always passes through the points of the original line, whereas the lines produced by the remaining algorithms never pass through these points. In some sense, this algorithm outputs a line which "circumscribes" the input line.

On the other hand, Chaiken's Algorithm outputs a line which "inscribes" a given line. The output line always touches/intersects the centre of the input line segment between two consecutive points. For more iterations, the property above does not hold, but the computed lines are very similar to the Bezier Splines. The disadvantage of the two algorithms given above is that they increase the number of points. However, Hermite Interpolation can be used as another simplification algorithm. To achieve this, it is necessary to set angle_thresh to higher values (15 or so).

One restriction on both McMasters' Algorithms is that look_ahead parameter must be odd. Also note that these algorithms have no effect if look_ahead = 1.

Note that Boyle's, McMasters' and Snakes algorithm are sometimes used in the signal processing to smooth the signals. More importantly, these algorithms never change the number of points on the lines; they only translate the points, and do not insert any new points.

Snakes Algorithm is (asymptotically) the slowest among the algorithms presented above. Also, it requires quite a lot of memory. This means that it is not very efficient for maps with the lines consisting of many segments.

DISPLACEMENT

The displacement is used when the lines overlap and/or are close to each other at the current level of detail. In general, displacement methods moves the conflicting features apart so that they do not interact and can be distinguished.

This module implements algorithm for displacement of linear features based on the Snakes approach. This method generally yields very good results; however, it requires a lot of memory and is not very efficient.

Displacement is selected by method=displacement. It uses following parameters:

The lines affected by the algorithm can be specified by the layer, cats and where parameters.

NETWORK GENERALIZATION

Used for selecting "the most important" part of the network. This is based on the graph algorithms. Network generalization is applied if method=network. The algorithm calculates three centrality measures for each line in the network and only the lines with the values greater than thresholds are selected. The behaviour of algorithm can be altered by the following parameters: All three parameters above can be presented at the same time. In that case, the algorithm selects only the lines which meet each criterion.

Also, the outputed network may not be connected if the value of betweeness_thresh is too large.

SEE ALSO

v.clean, v.dissolve

v.generalize Tutorial (from GRASS-Wiki)

AUTHORS

Daniel Bundala, Google Summer of Code 2007, Student
Wolf Bergenheim, Mentor

Last changed: $Date$