A modified Douglas-Pecuker simplification algorithm

This paper focuses on the linear features generalization which is to select proper characteristic points when the map scale is changed. Douglas-Pecuker (DP) simplification algorithm is well accepted and used for this purpose. In the classic DP algorithm, only the polyline´s sequence of vertex enters the simplification process. The classic algorithm is to select the vertex from the original polyline by comparing the farthest distance and the given threshold. But it is difficult to get a threshold automatically. Therefore, a modified DP simplification algorithm is presented in the paper. By Tofer´s radical law, we present the dynamic threshold to solve the threshold problem