M. Basseville and I. V. Nikiforov, Detection of Abrupt Changes: Theory and Application, 1993.
URL : https://hal.archives-ouvertes.fr/hal-00008518

M. Fliess, C. Join, and H. Sira-ramírez, Non-linear estimation is easy, International Journal of Modelling, Identification and Control, vol.4, issue.1, 2008.
DOI : 10.1504/IJMIC.2008.020996
URL : https://hal.archives-ouvertes.fr/inria-00158855

M. Fliess and H. , Sira-Ramírez, Closed-loop parametric identification for continuoustime linear systems via new algebraic techniques Continuous-Time Model Identification from Sampled Data, 2008.

A. Kolesnikov, Efficient algorithms for vectorization and polygonal approximation, 2003.

M. Lavielle, Using penalized contrasts for the change-point problem, Signal Processing, vol.85, issue.8, pp.1501-1510, 2005.
DOI : 10.1016/j.sigpro.2005.01.012
URL : https://hal.archives-ouvertes.fr/inria-00070662

M. Mboup, C. Join, and M. Fliess, A revised look at numerical differentiation with an application to nonlinear feedback control, 2007 Mediterranean Conference on Control & Automation, 2007.
DOI : 10.1109/MED.2007.4433728
URL : https://hal.archives-ouvertes.fr/inria-00142588

M. Mboup, C. Join, and M. Fliess, A delay estimation approach to change-point detection, Proc. 16 th Mediterrean Conf. Control Automation (MED'2007), 2008.
URL : https://hal.archives-ouvertes.fr/inria-00179775

J. Lee, J. Chung, and J. Kim, Optimal vertex adjustement method using Viterbi algorithm for vertex-based shape coding, Electronics Letters, vol.35, 1999.

M. Marji and P. Siy, A new algorithm for dominant points detection and polygonization of digital curves, Pattern recognition, 2003.

A. Mikheev, L. Vincent, and V. Faber, High-Quality Polygonal Contour Approximation Based on Relaxation, International conference on document analysis and recognition, 2001.

J. Perez and E. Vidal, Optimum Polygonal Approximation of Digitized Curves, Pattern recognition letters, 1994.

B. K. Ray and K. S. , A New Split-and-merge Technique for Polygonal Approximation of Chain Coded Curves, Pattern recognition letters, 1995.

M. Röösli and G. Monagan, Adding Geometric Constraints to the Vectorization of Line Drawings, Graphics Recognition?Methods and Applications, Lecture Notes and Computer Science, p.1072, 1996.

P. L. Rosin, Assessing the behaviour of polygonal approximation algorithms, Pattern recognition, 2004.

J. Song, F. Su, C. Tai, and S. Cai, An Object-Oriented Progressive-Simplification Based Vectorization System for Engineering Drawings: Model, Algorithm, and Performance, IEEE Transactions on Pattern Analysis, issue.8, p.24, 2002.

K. Tombre and S. Tabbone, Vectorization in graphics recognition: to thin or not to thin, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2000.
DOI : 10.1109/ICPR.2000.906024
URL : https://hal.archives-ouvertes.fr/inria-00099349

V. J. Traver, G. Recatalá, and J. Inesta, Exploring the performance of genetic algorithms as polygonal approximators, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2000.
DOI : 10.1109/ICPR.2000.903657

W. Wu, An adaptive method for detecting dominant points, Pattern Recognition, vol.36, issue.10, 2003.
DOI : 10.1016/S0031-3203(03)00087-6

P. Yin, Algorithms for straight line fitting using k-means, Pattern Recognition Letters, vol.19, issue.1, 1998.
DOI : 10.1016/S0167-8655(97)00154-2