The improved Douglas-Peucker algorithm based on the contour character

Compared with the common line-simple algorithm, contour generalization pays more attention on the spatial relationship and coordination between the lines. Using the common D-P algorithm may cause intersection or self-intersection. Combined with the particularity of contours, this paper improves the Douglas-Peucker simplification algorithm from tolerance, curvature and the simplified method. The experiment proves that the contour simplification receives a reasonable result through this algorithm; the topological structure and shape characteristic of contours have been well preserved.