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

Revision as of 12:56, 25 March 2024

Revision as of 12:57, 25 March 2024

Line 16:

== Algorithm ==

{{Quote frame|It then finds the point that is farthest from the line segment...}}

In the pseudocode section the distance measure used is the perpendicular distance from a point to a line: <brcode>perpendicularDistance(PointList[i], Line(PointList[1], PointList[end]))</code>.<br>

<br>An alternative, one which i believe is correct and also fits with the wording of the text (i.e. ″line segment″), 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. In this case the distance of the point from the line segment is the distance of the point to whichever line endpoint is closest. [[User:Petkond|Petkond]] ([[User talk:Petkond|talk]]) 12:24, 25 March 2024 (UTC)

<br><code>perpendicularDistance(PointList[i], Line(PointList[1], PointList[end]))</code>.<br>

<br>An alternative, one which i believe is correct and also fits with the wording of the text (i.e. ″line segment″), 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. In this case the distance of the point from the line segment is the distance of the point to whichever line endpoint is closest. [[User:Petkond|Petkond]] ([[User talk:Petkond|talk]]) 12:24, 25 March 2024 (UTC)

== Visvalingam’s algorithm ==