Content deleted Content added
Waldyrious (talk | contribs) →Other line simplification algorithms: convert section to "See also"; link to Curve fitting |
link to Cartographic Generalization |
||
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 [[Cartographic generalization]].
== Idea ==
| |||