Ramer–Douglas–Peucker algorithm: Difference between revisions

Revision as of 15:36, 4 August 2024

Revision as of 12:30, 5 August 2024

Line 1:

{{Short description|Curve simplification algorithm}}

The '''Ramer–Douglas–Peucker algorithm''', also known as the '''Douglas–Peucker algorithm''' and '''iterative end-point fit algorithm''', is an algorithm that [[Decimation (signal processing)|decimates]] a curve composed of line segments to a similar curve with fewer points. It was one of the earliest successful algorithms developed for [[cartographic generalization]]. It produces the most accurate generalization, but it is also more time-consuming.<ref>{{cite journal |last1=Shi |first1=Wenzhong |last2=Cheung |first2=ChuiKwan |title=Performance Evaluation of Line Simplification Algorithms for Vector Generalization |journal=The Cartographic Journal |date=2006 |volume=43( |issue=1) |pages=27-44 |doi=10.1179/000870406x93490}}</ref>

== Idea ==