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 line segments to a similar curve with fewer points. It was one of the earliest successful algorithms developed for cartographic generalization. Idea[edit] The purpose of the algorithm is, given a curve composed of line segments (
![Ramer-Douglas-Peucker algorithm - Wikipedia, the free encyclopedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/9529f6865cd42cbb585ad2afbcef3a248e563181/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2F3%2F30%2FDouglas-Peucker_animated.gif%2F220px-Douglas-Peucker_animated.gif)