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

Revision as of 10:21, 28 September 2012

Revision as of 20:02, 5 November 2013

Line 15:

== Visvalingam’s algorithm ==

There's a blog [http://bost.ocks.org/mike/simplify/ here] explaining Visvalingam’s algorithm, a different (and purportedly more effective) line simplification algorithm. [[User:Diego Moya|Diego]] ([[User talk:Diego Moya|talk]]) 10:21, 28 September 2012 (UTC)

== Pseudocode ==

Is it just me or is the pseudocode wrong? In this line:

ResultList[] = {recResults1[1...end-1] recResults2[1...end]}

...you'd go off the end of the arrays which are shorter than the original array.