Description: Douglas a Peukcer algorithm proposed in 1973 by the D.Douglas and T.Peueker, referred to as D a P algorithm, is now recognized as a classic linear feature simplification algorithm. Existing line simplification algorithm, a considerable part of the algorithm is based on the improvements generated. Its advantage is a translational and rotational invariance, the value of a given curve and Ae, sampling results must. The basic idea of the algorithm is: even a straight line for each curve of the first and last point is true, seek from all points with a straight line, and find the value of the maximum distance dmax, dmax and tolerance compared with D: If dmax < D, which the middle point of the curve on all the discarded If dmax ≥ D, keep dmax corresponding coordinate point, and that point for the community, the curve is divided into two parts, both parts of the repeated use of the method.
To Search:
File list (Check if you may need any files):
Douglas-Peuker
..............\1.txt
..............\2.txt
..............\DouglasPeuker.cpp
..............\DouglasPeuker.dsp
..............\DouglasPeuker.dsw
..............\jpl_vegetation_grass.txt
..............\jpl_vegetation_grass2.txt
..............\ReadMe.txt
..............\StdAfx.cpp
..............\StdAfx.h
Download