Revision as of 13:40, 29 September 2008 edit RJFJR (talk \| contribs) Administrators 167,052 edits m →Algorithm: typo ← Previous edit		Revision as of 11:02, 28 October 2008 edit undo 194.78.35.195 (talk) →Idea Next edit →
Line 2: == Idea == The purpose of the algorithm is that given a 'curve' ~~cmposed~~composed of line segments to find a curve not too dissimilar but that has fewer points. The algorithm defines 'too dissimilar' based on the maximum distance between the original curve and the smoothed curve. The smoothed curve consists of a subset of the points that defined the original curve. == Algorithm ==

Ramer–Douglas–Peucker algorithm: Difference between revisions