T. P. Nguyen, I. Debled-rennesson, N. Loria, and . University, A linear method for curves segmentation into digital arcs, 2010.

T. P. Nguyen, A discrete geometry approach for dominant point detection, Pattern Recognition, vol.44, issue.1, pp.32-44, 2011.
DOI : 10.1016/j.patcog.2010.06.022
URL : https://hal.archives-ouvertes.fr/inria-00526714

P. L. Rosin and G. A. West, Segmentation of edges into lines and arcs, Image and Vision Computing, vol.7, issue.2, pp.109-114, 1989.
DOI : 10.1016/0262-8856(89)90004-8

J. Chen, J. A. Ventura, and W. C. , Segmentation of planar curves into circular arcs and line segments, Image and Vision Computing, vol.14, issue.1, pp.71-83, 1996.
DOI : 10.1016/0262-8856(95)01042-4

J. H. Horng and J. T. Li, A dynamic programming approach for fitting digital planar curves with line segments and circular arcs, Pattern Recognition Letters, vol.22, issue.2, pp.183-197, 2001.
DOI : 10.1016/S0167-8655(00)00104-5

J. H. Horng, An adaptive smoothing approach for fitting digital planar curves with line segments and circular arcs, Pattern Recognition Letters, vol.24, issue.1-3, pp.565-577, 2003.
DOI : 10.1016/S0167-8655(02)00277-5

J. P. Salmon, I. Debled-rennesson, and L. Wendling, A new method to detect arcs and segments from curvature profiles, 18th International Conference on Pattern Recognition (ICPR'06), pp.387-390, 2006.
DOI : 10.1109/ICPR.2006.123
URL : https://hal.archives-ouvertes.fr/inria-00104414

F. Tortorella, R. Patraccone, and M. Molinara, A Dynamic Programming approach for segmenting digital planar curves into line segments and circular arcs, 2008 19th International Conference on Pattern Recognition, pp.1-4, 2008.
DOI : 10.1109/ICPR.2008.4761177

E. M. Arkin, L. P. Chew, D. P. Huttenlocher, K. Kedem, and J. S. Mitchell, An efficiently computable metric for comparing polygonal shapes, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.13, issue.3, pp.209-216, 1991.
DOI : 10.1109/34.75509
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.461.1828

E. Bodansky and A. G. , Approximation of a Polyline with a Sequence of Geometric Primitives, In: ICIAR. LNCS, vol.4142, pp.468-478, 2006.
DOI : 10.1007/11867661_42

I. Debled-rennesson, F. Feschet, and J. Rouyer-degli, Optimal blurred segments decomposition of noisy shapes in linear time, Computers & Graphics, vol.30, issue.1, pp.30-36, 2006.
DOI : 10.1016/j.cag.2005.10.007
URL : https://hal.archives-ouvertes.fr/inria-00173228

T. P. Nguyen and I. Debled-rennesson, Curvature Estimation in Noisy Curves, LNCS, vol.4673, pp.474-481, 2007.
DOI : 10.1007/978-3-540-74272-2_59
URL : https://hal.archives-ouvertes.fr/hal-00184127

L. Latecki and R. Lakamper, Shape similarity measure based on correspondence of visual parts, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.22, issue.10, pp.1185-1190, 2000.
DOI : 10.1109/34.879802

D. Sarkar, A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves, Pattern Recognition Letters, vol.14, issue.12, pp.959-964, 1993.
DOI : 10.1016/0167-8655(93)90004-W