Douglas-Peucker Algorithm
The Douglas–Peucker algorithm reduces the number of points in a curve.
現在この提出コンテンツをフォロー中です。
- フォローしているコンテンツ フィードに更新が表示されます。
- コミュニケーション基本設定に応じて電子メールを受け取ることができます
編集メモ: 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)
%
引用
Reza Ahmadzadeh (2026). Douglas-Peucker Algorithm (https://jp.mathworks.com/matlabcentral/fileexchange/61046-douglas-peucker-algorithm), MATLAB Central File Exchange. に取得済み.
謝辞
ヒントを与えたファイル: Douglas-Peucker Algorithm, line simplification by distance
