Simplification of a polygonal curve with the Douglas-Peucker algorithm.

<p>(A) Original polygonal curve. (B) First approximation by a line segment, and determination of the furthest vertex. (C) Splitting of the curve into two sub-curves, and determination of the furthest vertices in each sub-curve. (D) Iteration of the procedure until the distance from the vertices to the simplified curve is lower than a predefined threshold.