I. Debled-rennesson, F. Feschet, and J. , Rouyer-Degli, Optimal blurred segments decomposition of noisy shapes in linear time, Computers & Graphics, vol.30, issue.3036, 2006.

A. Faure, L. Buzer, and F. Feschet, Tangential cover for thick digital curves, Pattern Recognition, vol.42, issue.10, p.22792287, 2009.
DOI : 10.1007/978-3-540-79126-3_32
URL : https://hal.archives-ouvertes.fr/hal-00622470

F. Feschet and L. Tougne, Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature, LNCS, vol.1568, p.3140, 1999.
DOI : 10.1007/3-540-49126-0_3
URL : https://hal.archives-ouvertes.fr/hal-01517330

T. P. Nguyen and I. , Debled-Rennesson, Curvature estimation in noisy curves, LNCS, vol.4673, p.474481, 2007.
DOI : 10.1007/978-3-540-74272-2_59
URL : https://hal.archives-ouvertes.fr/hal-00184127/document

T. P. Nguyen and I. , Debled-Rennesson, A discrete geometry approach for dominant point detection, Pattern Recognition, vol.44, issue.3244, 2011.

E. Attneave, Some informational aspects of visual perception., Psychological Review, vol.61, issue.3, p.183193, 1954.
DOI : 10.1037/h0054663

E. J. Aguilera-aguilera, Á. C. Poyato, F. J. Madrid-cuevas, and R. M. Carnicer, The computation of polygonal approximations for 2D contours based on a concavity tree, Journal of Visual Communication and Image Representation, vol.25, issue.8
DOI : 10.1016/j.jvcir.2014.09.012

A. R. Backes and O. M. Bruno, Polygonal approximation of digital planar curves through vertex betweenness, Information Sciences, vol.222, issue.795, p.804, 2013.
DOI : 10.1016/j.ins.2012.07.062

P. Bhowmick and B. B. Bhattacharya, Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.29, issue.9, p.15901602, 2007.
DOI : 10.1109/TPAMI.2007.1082

F. Feschet, Fast Guaranteed Polygonal Approximations of Closed Digital Curves, LNCS, vol.3540, p.910919, 2005.
DOI : 10.1007/11499145_92

M. Marji and P. Siy, A new algorithm for dominant points detection and polygonization of digital curves, Pattern Recognition, vol.36, issue.10, p.22392251, 2003.
DOI : 10.1016/S0031-3203(03)00119-5

M. Marji and P. Siy, Polygonal representation of digital planar curves through dominant point detection???a nonparametric algorithm, Pattern Recognition, vol.37, issue.11, p.21132130, 2004.
DOI : 10.1016/j.patcog.2004.03.004

A. Masood, Dominant point detection by reverse polygonization of digital curves, Image and Vision Computing, vol.26, issue.5, p.702715, 2008.
DOI : 10.1016/j.imavis.2007.08.006

A. Masood, Optimized polygonal approximation by dominant point deletion, Pattern Recognition, vol.41, issue.1, p.227239, 2008.
DOI : 10.1016/j.patcog.2007.05.021

P. L. Rosin, Techniques for assessing polygonal approximations of curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.19, issue.659666, 1997.

D. Sarkar, A simple algorithm for detection of signicant vertices for polygonal approximation of chain-coded curves, Pattern Recognition Letters, vol.14, issue.12, p.959964, 1993.

C. H. Teh and R. T. Chin, On the detection of dominant points on digital curves, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.11, issue.8, 1989.
DOI : 10.1109/34.31447

B. Wang, D. Brown, X. Zhang, H. Li, Y. Gao et al., Polygonal approximation using integer particle swarm optimization, Information Sciences, vol.278, p.311326, 2014.
DOI : 10.1016/j.ins.2014.03.055

E. J. Aguilera-aguilera, Á. C. Poyato, F. J. Madrid-cuevas, and R. Muñoz-salinas, Novel method to obtain the optimal polygonal approximation of digital planar curves based on mixed integer programming, Visual Communication and Image Representation, pp.30-106116, 2015.

D. K. Prasad, M. K. Leung, C. Quek, and S. Cho, A novel framework for making dominant point detection methods non-parametric, Image and Vision Computing, vol.30, issue.11, 2012.
DOI : 10.1016/j.imavis.2012.06.010

A. Kolesnikov and P. Fränti, Reduced-search dynamic programming for approximation of polygonal curves, Pattern Recognition Letters, vol.24, issue.14, p.22432254, 2003.
DOI : 10.1016/S0167-8655(03)00051-5

A. Kolesnikov and P. Fränti, Polygonal approximation of closed discrete curves, Pattern Recognition, vol.40, issue.4, p.12821293, 2007.
DOI : 10.1016/j.patcog.2006.09.002

J. Perez and E. Vidal, Optimum polygonal approximation of digitized curves, Pattern Recognition Letters, vol.15, issue.8, p.743750, 1994.
DOI : 10.1016/0167-8655(94)90002-7

N. L. García, L. D. Martínez, Á. C. Poyato, F. J. Madrid-cuevas, and R. M. Carnicer, A new thresholding approach for automatic generation of polygonal approximations, Visual Communication and Image Representation, vol.35, p.155168, 2016.

U. Ramer, An iterative procedure for the polygonal approximation of planar curves, Computer, Graphic and Image processing, vol.1, p.224256, 1972.

D. H. Douglas and T. K. Peucker, Algorithms for the reduction of the number of points required to represent a digitized line or its caricature, Cartographica: The International Journal for Geographic Information and Geovisualization, vol.10, issue.2, p.112122, 1973.

L. J. Latecki and R. Lakämper, Convexity Rule for Shape Decomposition Based on Discrete Contour Evolution, Computer Vision and Image Understanding, vol.73, issue.3, p.441454, 1999.
DOI : 10.1006/cviu.1998.0738
URL : http://www.cis.temple.edu/~latecki/Papers/cviu99.pdf

Á. C. Poyato, N. L. García, R. M. Carnicer, and F. J. Madrid-cuevas, Dominant point detection: A new proposal, Image Vision Computing, vol.23, issue.13, p.12261236, 2005.

B. K. Ray and K. S. Ray, Detection of signicant points and polygonal approximation of digitized curves, Pattern Recognition Letters, vol.13, issue.6, p.443452, 1992.

W. Wu, Dominant point detection using adaptive bending value, Image and Vision Computing, vol.21, issue.6, p.517525, 2003.
DOI : 10.1016/S0262-8856(03)00031-3

A. Rosenfeld and E. Johnston, Angle Detection on Digital Curves, IEEE Transactions on Computers, vol.22, issue.9, 1973.
DOI : 10.1109/TC.1973.5009188

M. T. Parvez and S. A. Mahmoud, Polygonal approximation of digital planar curves through adaptive optimizations, Pattern Recognition Letters, vol.31, issue.13, 2010.
DOI : 10.1016/j.patrec.2010.06.007

J. Reveillès, Géométrie discrète, calculs en nombre entiers et algorithmique , thèse d'état, 1991.

T. P. Nguyen, B. Kerautret, I. Debled-rennesson, and J. , Lachaud, Unsupervised , Fast and Precise Recognition of Digital Arcs in Noisy Images, LNCS, vol.6374, p.5968, 2010.

B. Kerautret and J. Lachaud, Meaningful Scales Detection: an Unsupervised Noise Detection Algorithm for Digital Contours, Image Processing On Line, vol.4, issue.18, 2014.
DOI : 10.5201/ipol.2014.75
URL : https://hal.archives-ouvertes.fr/hal-01112936

B. Kerautret and J. Lachaud, Meaningful Scales Detection along Digital Contours for Unsupervised Local Noise Estimation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.34, issue.12, p.23792392, 2012.
DOI : 10.1109/TPAMI.2012.38
URL : https://hal.archives-ouvertes.fr/hal-00780689

H. Liu, L. J. Latecki, and W. Liu, A unied curvature denition for regular, polygonal, and digital planar curves, International Journal Comput. Vision, vol.80, issue.1, p.104124, 2008.
DOI : 10.1007/s11263-008-0131-y

I. Sivignon, A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplication Under the Fréchet Distance, Image Processing On Line, vol.4, p.116127, 2014.

J. Macqueen, Some methods for classication and analysis of multivariate observations, BSMSP, vol.1, p.281297, 1967.

D. J. Bora and A. K. Gupta, Eect of dierent distance measures on the performance of k-means algorithm: An experimental study in matlab, International Journal of Computer Science and Information Technologies, vol.5, p.25012506, 2014.