Ramer–Douglas–Peucker algorithm: Difference between revisions

Content deleted Content added
rv unexplained deletion ; Undid revision 991607303 by 45.172.126.19 (talk)
top: ordinary caps
Line 1:
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 [[Cartographiccartographic generalization]].
 
== Idea ==