Ramer–Douglas–Peucker algorithm: Difference between revisions

Content deleted Content added
Removed idea section, it is unsourced since "big copy edit" revision in 2008, it is inaccurate as the algorithm does not use Hausdorff distance, in the algorithm the simplified curve is treated as a curve but the original curve is only treated using its vertices and the farthest point is always selected from the original curve, even if the idea section is correct it is still unnecessarily abstract and more confusing than the algorithm itself, feel free to discuss at my talk page
Removed wikilinks to non-existent pages
Line 72:
Alternative algorithms for line simplification include:
* [[Visvalingam–Whyatt algorithm|Visvalingam–Whyatt]]
* [[Reumann–Witkam algorithm|Reumann–Witkam]]
* [[Opheim simplification
* algorithm|OpheimLang simplification]]
* Zhao–Saalfeld
* [[Lang simplification algorithm|Lang simplification]]
* [[Zhao–Saalfeld algorithm|Zhao–Saalfeld]]
 
== See also ==