Line Simplification

Recursive Douglas-Peucker Polyline Simplification (Iterative Endpoint Fit)

버전 1.4.0.0 (6.03 KB)
다운로드 수: 7.9K
(17)
2010/7/13

이 제출물을 팔로우합니다

편집자 메모: 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

인용 양식

Wolfgang Schwanghart (2026). Line Simplification (https://kr.mathworks.com/matlabcentral/fileexchange/21132-line-simplification), MATLAB Central File Exchange. 검색 날짜: .

카테고리

Help Center 및 MATLAB Answers에서 Octave에 대해 자세히 알아보기

일반 정보

MATLAB 릴리스 호환 정보

  • 모든 릴리스와 호환

플랫폼 호환성

  • Windows
  • macOS
  • Linux
새 탭에서 열기
버전 퍼블리시됨 릴리스 정보
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.