M. A. Abam, P. Mark-de-berg, A. Hachenberger, and . Zarei, Streaming algorithms for line simplification, Proceedings of the twenty-third annual symposium

P. K. Agarwal, S. Har-peled, N. H. Mustafa, and Y. Wang, Near-linear time approximation algorithms for curve simplification, Algorithmica, pp.42-203, 2005.

W. S. Chan and F. Chin, Approximation of polygonal curves with minimum number of line segments, Proceedings of 3rd International Symposium on Algorithms and Computation, pp.378-387, 1992.
DOI : 10.1007/3-540-56279-6_90

I. Sivignon, A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fr??chet Distance, Proceedings of the 16th IAPR International Discrete Geometry for Computer Imagery, pp.333-345, 2011.
DOI : 10.1007/978-3-642-19867-0_28