Line Simplification
Recursive Douglas-Peucker Polyline Simplification (Iterative Endpoint Fit)
Vous suivez désormais cette soumission
- Les mises à jour seront visibles dans votre flux de contenu suivi
- Selon vos préférences en matière de communication il est possible que vous receviez des e-mails
Note de l’éditeur : This file was selected as MATLAB Central Pick of the Week
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.
Syntax:
[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
http://en.wikipedia.org/wiki/Ramer-Douglas-Peucker_algorithm
Citation pour cette source
Wolfgang Schwanghart (2026). Line Simplification (https://fr.mathworks.com/matlabcentral/fileexchange/21132-line-simplification), MATLAB Central File Exchange. Extrait(e) le .
Informations générales
- Version 1.4.0.0 (6,03 ko)
Compatibilité avec les versions de MATLAB
- Compatible avec toutes les versions
Plateformes compatibles
- Windows
- macOS
- Linux
| Version | Publié le | Notes de version | Action |
|---|---|---|---|
| 1.4.0.0 | added m-file that runs with GNU Octave |
||
| 1.3.0.0 | Added some information in the description. |
||
| 1.2.0.0 | Removed a bug in calculating the second output argument. Improved handling of lines with only one segment. |
||
| 1.1.0.0 | only minor changes: added some comments and changed the link to more information since it was dead. |
||
| 1.0.0.0 | 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. |
