G. Damiand and D. Coeurjolly, A generic and parallel algorithm for 2D digital curve polygonal approximation, Journal of Real-Time Image Processing, vol.36, issue.8, pp.145-157, 2011.
DOI : 10.1007/s11554-011-0193-x
URL : https://hal.archives-ouvertes.fr/hal-00636402

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

I. Debled-rennesson and J. P. Reveilì-es, A LINEAR ALGORITHM FOR SEGMENTATION OF DIGITAL CURVES, International Journal of Pattern Recognition and Artificial Intelligence, vol.09, issue.04, pp.635-662, 1995.
DOI : 10.1142/S0218001495000249

I. Debled-rennesson and J. P. Reveilì-es, A new approach to digital planes, SPIE -Vision Geometry III, 1994.
DOI : 10.1117/12.198607

D. Harel and R. E. Tarjan, Fast Algorithms for Finding Nearest Common Ancestors, SIAM Journal on Computing, vol.13, issue.2, pp.338-355, 1984.
DOI : 10.1137/0213024

M. A. Jacob, Applications quasi-affines, 1993.

J. O. Lachaud and M. Said, Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line, Discrete Applied Mathematics, vol.161, issue.15, pp.2293-2315, 2013.
DOI : 10.1016/j.dam.2012.08.038

M. D. Mcilroy, A Note on Discrete Representation of Lines, AT&T Technical Journal, vol.64, issue.2, pp.481-490, 1985.
DOI : 10.1002/j.1538-7305.1985.tb00359.x

O. 'rourke and J. , An on-line algorithm for fitting straight lines between data ranges, Communications of the ACM, vol.24, issue.9, pp.574-578, 1981.
DOI : 10.1145/358746.358758

O. 'rourke and J. , Computational Geometry in C, 1998.

T. Roussillon, L. Tougne, and I. Sivignon, Computation of Binary Objects Sides Number using Discrete Geometry, Application to Automatic Pebbles Shape Analysis, 14th International Conference on Image Analysis and Processing (ICIAP 2007), pp.763-768, 2007.
DOI : 10.1109/ICIAP.2007.4362868
URL : https://hal.archives-ouvertes.fr/hal-00185119

T. Roussillon, Algorithmes d'extraction de modèles géométriques discrets pour la représentation robuste des formes, 2009.

M. Said, J. O. Lachaud, and F. Feschet, Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines, 2010 20th International Conference on Pattern Recognition, pp.4097-4100, 2010.
DOI : 10.1109/ICPR.2010.996

I. Sivignon, F. Dupont, and J. M. Chassery, Digital Intersections: minimal carrier, connectivity, and periodicity properties, Graphical Models, vol.66, issue.4, pp.226-244, 2004.
DOI : 10.1016/j.gmod.2004.05.002
URL : https://hal.archives-ouvertes.fr/hal-00185082

I. Sivignon, Walking in the Farey Fan to Compute the Characteristics of a Discrete Straight Line Subsegment, Discrete Geometry for Computer Imagery, pp.23-34, 2013.
DOI : 10.1007/978-3-642-37067-0_3
URL : https://hal.archives-ouvertes.fr/hal-00765981