Revision as of 12:38, 25 March 2024 edit Petkond (talk \| contribs) 21 edits No edit summary ← Previous edit		Revision as of 12:39, 25 March 2024 edit undo Petkond (talk \| contribs) 21 edits No edit summary Next edit →
Line 16: == Algorithm == {{Quote frame\|It then finds the point that is farthest from the line segment...}} In the pseudocode section this is interpreted to mean perpendicular distance from a point to a line <br> <code>perpendicularDistance(PointList[i], Line(PointList[1], PointList[end]))</code>.<br> An alternative interpretation, one which i believe is correct, is shortest distance from a point to a line segment (see also [https://karthaus.nl/rdp/ this]). The latter differs from the former if the projection of the point on the line does not lie between the two points defining the line. [[User:Petkond\|Petkond]] ([[User talk:Petkond\|talk]]) 12:24, 25 March 2024 (UTC)

Talk:Ramer–Douglas–Peucker algorithm: Difference between revisions