Douglas-Peucker Algorithm

The Douglas–Peucker algorithm reduces the number of points in a curve.
Updated 7 Jan 2017

View License

Editor's Note: This file was selected as MATLAB Central Pick of the Week

% 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]
% Input:
% 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)
% Output:
% result: List of Points for the approximated curve 2xM (M<=N)

Cite As

Reza Ahmadzadeh (2024). Douglas-Peucker Algorithm (, MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2008a
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes

snapshot added.