Ramer–Douglas–Peucker algorithm: Difference between revisions

Content deleted Content added
link rot
AnomieBOT (talk | contribs)
m Dating maintenance tags: {{Linkrot}}
Line 1:
{{Short description|Curve simplification algorithm}}
{{linkrot|date=June 2024}}
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]].