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.

Oops something went wrong: