Generalization of the “Douglas and Peucker” Algorithm.
Returns the simplified curve using the Douglas-Peucker algorithm, as an array of Point, for the data entered as the argument of the Constructor. The required tolerance must have been previously entered using the setTolerance method.
Visvalingam and Williamson (1995) found that the Douglas-Peucker algorithm (1973) was better than Visvalingam's algorithm for minimal simplification of 2D lines. Since the Douglas-Peucker algorithm is more readily available, Visvalingam and Dowson (1999) investigated its utility for P-stoke sketching.
For example, in the following posts I reverse-geocoded the spatial data set and reduced its size with clustering algorithms and the Douglas-Peucker algorithm: Reverse-geocoding the data set to get city and country data; Reducing the size of the data set with DBSCAN clustering; Reducing the size of the data set with the Douglas-Peucker algorithm.
A classic algorithm used for line simplification. This algorithm was introduced to the world by David H. Douglas and Thomas K. Peucker in a 1973 article in the journal Canadian Cartographer. It is by no means the fastest algorithm, taking O (n log N) time at best and O (N2) at worst.
Douglas-Peucker; Errors: Positional; Reumann-Witkam. Instead of using a point-to-point (radial) distance tolerance as a rejection criterion (see Radial Distance), the O(n) Reumann-Witkam routine uses a point-to-line (perpendicular) distance tolerance. It defines a line through the first two vertices of the original polyline.. The algorithm.
This tool uses the same algorithm as the Simplify Line tool's point remove method (the Douglas-Peucker simplification algorithm). The Simplify Line tool provides more parameters and creates a new output, whereas this tool modifies the input feature class. This tool generalizes features record by record. Sections of lines and polygon boundaries which were coincident between features may not be.
Using classical algorithms of vector data compression, such as the Douglas-Peucker algorithm, to simplify the natural shoreline into direction-line, ignores the special requirements of a guarantee.