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

Revision as of 12:28, 25 March 2024

Latest revision as of 14:55, 14 March 2025

(10 intermediate revisions by 2 users not shown)

Line 1:

{{WikiProject banner shell|class=}}

Start|1=

{{WikiProject Computer graphics |importance=Low}}

}}

I am in the process of converting [[http://de.wikipedia.org/wiki/Douglas-Peucker-Algorithmus The Germain Wikipedia Article]] from the original using google bablefish. I can't figure out how to copy the images out of the german text. I'll keep at it but please help if you know how. I'll be back online later tonight.--[[User:GreatTurtle|GreatTurtle]] ([[User talk:GreatTurtle|talk]]) 19:23, 24 June 2008 (UTC)

Line 16 ⟶ 19:

== Algorithm ==

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

In the pseudocode'''Pseudocode''' section thisthe isdistance interpretedmeasure toused is meanthe perpendicular distance from a point to a line: <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 laterlatter 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 ==