% The Ramer–Douglas–Peucker algorithm (RDP) is an algorithm for reducing
% the number of points in a curve that is approximated by a series of
% points. The initial form of the algorithm was independently suggested
% in 1972 by Urs Ramer and 1973 by David Douglas and Thomas Peucker and
% several others in the following decade. This algorithm is also known
% under the names Douglas–Peucker algorithm, iterative end-point fit
% algorithm and split-and-merge algorithm. [Source Wikipedia]
% Points: List of Points 2xN
% epsilon: distance dimension, specifies the similarity between
% the original curve and the approximated (smaller the epsilon,
% the curves more similar)
% result: List of Points for the approximated curve 2xM (M<=N)
it do not work for polygons ?or closed objects ?
Thanks for this routine. Here's a failure case:
The problem arises because you only consider the perpendicular distance from the simplified line. You need also to consider the actual distance from the end points when the original points lie to the left or right of the simplified line.
Also, please consider an extension of "doing the right thing" when NaNs are present. These allow breaks in a line when plotting within Matlab. These breaks should be preserved (i.e., D-P simplification should be applied to each continuous segment) and adjacent NaN should be compressed to a single NaN. Thanks for your consideration.
Perfect work. :)