The Ramer–Douglas–Peucker algorithm, also known as the Douglas–Peucker algorithm and iterative end-point fit algorithm, is an algorithm that #decimates a curve composed of #lineSegments to a similar curve with fewer points. It was one of the earliest successful algorithms developed for #cartographicGeneralization. It produces the most accurate generalization, but it is also more time-consuming.