C. E. Anderson and . Kim, 18, 0) on the (x, y)-interval [1, 7] × [2, 5] Around it, the plane segments obtained by removing one row or column with the new plane characteristics In red, leaning points In pink (in the center), points that have maximal and minimal remainders, would be leaning points in all the plane segments if Theorem 1 were respected in dimension 3 Representation of digital line segments and their preimages, Figure 6: 3D Planes with remainders Computer Vision, Graphics and Image Processing, pp.279-288, 1985.

V. Berthé and S. Labbé, An Arithmetic and Combinatorial Approach to Three-Dimensional Discrete Lines, DGCI, pp.47-58, 2011.
DOI : 10.1007/978-3-642-19867-0_4

R. Brons, Linguistic Methods for the Description of a Straight Line on a Grid, Computer Graphics and Image Processing, vol.3, issue.1, pp.48-62, 1974.
DOI : 10.1016/0146-664X(74)90010-0

L. Buzer, Digital Line Recognition, Convex Hull, Thickness, a Unified and Logarithmic Technique, Combinatorial Image Analysis, pp.189-198
DOI : 10.1007/11774938_15
URL : https://hal.archives-ouvertes.fr/hal-00622019

M. Ethan, G. A. Coven, and . Hedlund, Sequences with minimal block growth, Mathematical Systems Theory, vol.7, issue.2, pp.138-153, 1973.

I. Debled-rennesson and J. Reveilles, A linear algorithm for segmentation of digital curves, IJPRAI, issue.04, pp.9635-662, 1995.

L. Dorst and A. W. Smeulders, Discrete straight line segments: parameters, primitives, and properties, Vision Geometry, series Contemporary Mathematics, pp.45-62, 1991.
DOI : 10.1090/conm/119/1113899
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.5282

R. Klette and A. Rosenfeld, Digital straightness???a review, Discrete Applied Mathematics, vol.139, issue.1-3, pp.197-230, 2004.
DOI : 10.1016/j.dam.2002.12.001
URL : http://doi.org/10.1016/j.dam.2002.12.001

D. Knuth, The Art of Computer Programming. V2. Seminumerical Algorithms, 1997.

J. 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. Morse and G. A. Hedlund, Symbolic Dynamics II. Sturmian Trajectories, American Journal of Mathematics, vol.62, issue.1/4, pp.1-42, 1940.
DOI : 10.2307/2371431

J. Reveillès, Calcul en Nombres Entiers et Algorithmique, 1991.

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

M. Said, J. Lachaud, and F. Feschet, Multiscale Discrete Geometry, DGCI'09, pp.118-131
DOI : 10.1007/11919629_22
URL : https://hal.archives-ouvertes.fr/hal-00413681

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

I. Sivignon, F. Dupont, and J. Chassery, New Results about Digital Intersections, Discrete Geometry for Computer Imagery, 11th International Conference, DGCI 2003, pp.102-113, 2003.
DOI : 10.1007/978-3-540-39966-7_9
URL : https://hal.archives-ouvertes.fr/hal-00185182

V. A. Kovalevsky, New definition and fast recognition of digital straight segments and arcs, [1990] Proceedings. 10th International Conference on Pattern Recognition, pp.31-34, 1990.
DOI : 10.1109/ICPR.1990.119324

A. Vacavant, T. Roussillon, B. Kerautret, and J. Lachaud, A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours, Computer Vision and Image Understanding, vol.117, issue.4, pp.438-450, 2013.
DOI : 10.1016/j.cviu.2012.07.006
URL : https://hal.archives-ouvertes.fr/hal-00943821

F. De, V. , and J. Lachaud, Revisiting digital straight segment recognition, DGCI'06, pp.355-366, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00308338