Universal approximate simplification under the discrete Fréchet distance

The problem of simplifying a polygonal curve or chain is well studied and has many applications. The discrete Fréchet distance is a useful similarity measure for curves, which has been utilized for many real-world applications. When the curves are huge, a simplification algorithm is needed in order to reduce running times. In this paper we adapt some of the techniques of Driemel and Har-Peled [5] (for the continuous Fréchet distance) to obtain a universal approximate simplification of a given polygonal curve, under the discrete Fréchet distance.