Revision as of 02:35, 17 July 2011 edit 71.164.79.232 (talk) →Complexity ← Previous edit		Revision as of 02:40, 17 July 2011 edit undo 71.164.79.232 (talk) →Pseudocode Next edit →
Line 22: index = 0 for i = 2 to (length(PointList) - 1) d = ~~OrthogonalDistance~~[[Perpendicular_distance\|PerpendicularDistance]](PointList[i], Line(PointList[1], PointList[end])) if d > dmax index = i

Ramer–Douglas–Peucker algorithm: Difference between revisions