Line Simplification

Versione 1.4.0.0 (6,03 KB) da Wolfgang Schwanghart
Recursive Douglas-Peucker Polyline Simplification (Iterative Endpoint Fit)
4.9
(17)
7,9K download
Aggiornato 13 lug 2010

Visualizza la licenza

Nota dell'editore: 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

Cita come

Wolfgang Schwanghart (2024). Line Simplification (https://www.mathworks.com/matlabcentral/fileexchange/21132-line-simplification), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2007b
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Categorie
Scopri di più su Octave in Help Center e MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Versione Pubblicato Note della release
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.