dpsimplify uses the recursive Douglas-Peucker line simplification algorithm to reduce the number of vertices in a polyline according to a specified tolerance. The algorithm is also know as Iterative Endpoint Fit algorithm. dpsimplify can handle polylines and polygones in 2d and higher dimensions.
The submission now contains another m-file (dpsimplify_octave.m) that has been slightly modified to run with GNU Octave.
[ps,ix] = dpsimplify(p,tol)
where p is a nxm matrix that contains n vertices in m dimensions.
For additional information on the algorithm follow this link
Wolfgang Schwanghart (2023). Line Simplification (https://www.mathworks.com/matlabcentral/fileexchange/21132-line-simplification), MATLAB Central File Exchange. 검색됨 .
MATLAB 릴리스 호환 정보
플랫폼 호환성Windows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!
added m-file that runs with GNU Octave
Added some information in the description.
Removed a bug in calculating the second output argument. Improved handling of lines with only one segment.
only minor changes: added some comments and changed the link to more information since it was dead.
First, the algorithm can now handle nans in the vertex array. It assumes that nans in the array serve as separator of single polylines and treats each polyline/polygon separately.