V. Boyer and J. Bourdin, Fast Lines: a Span by Span Method, Computer Graphics Forum, vol.18, issue.3, 1999.
DOI : 10.1111/1467-8659.00358

V. Boyer and J. Bourdin, Auto-adaptive step straight-line algorithm, IEEE Computer Graphics and Applications, vol.20, issue.5, pp.67-69, 2000.
DOI : 10.1109/38.865882

E. Jack and . Bresenham, Algorithm for computer control of a digital plotter, IBM Systems Journal, vol.4, pp.25-30, 1965.

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

R. Brons, Theoretical and Linguistic Methods for Describing Straight Lines, Fundamental Algorithms for Computer Graphics, pp.19-57, 1985.
DOI : 10.1007/978-3-642-84574-1_1

A. M. Bruckstein, Self-similarity properties of digitized straight lines, Contemporary Mathematics: Vision Geometry Proceedings of an AMS Speical Session, pp.1-20, 1989.
DOI : 10.1090/conm/119/1113896

M. Dorigo, V. Maniezzo, and A. Colorni, Ant system: optimization by a colony of cooperating agents, IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), vol.26, issue.1, pp.1-13, 1996.
DOI : 10.1109/3477.484436

H. Freeman, On the encoding of arbitrary geometric configurations. The Institute of Radio Engineers Inc. (IRE) Transactions on Electronic Computers, pp.260-268, 1961.

H. Freeman, Boundary encoding and processing, Picture Processing and Psychopictorics, pp.241-266, 1970.

[. Geer, On Cellular Lines. Department of Mathematical Sci- ences, Rensselaer Polytechnic Institute, 2002.

[. Geer, H. W. Mclaughlin, D. Scherzer, and K. Unsworth, 3D Cellular lines: A definition, 2003.

[. Geer, H. W. Mclaughlin, and K. Unsworth, Discrete lines and ant algorithms, 2001.

P. Geer, H. W. Mclaughlin, and K. Unsworth, Cellular lines: Existence, uniqueness , and construction, 2003.

A. Hübler, R. Klette, and K. Voss, Determination of the convex hull of a finite set of planar points within linear time, Elektronische Informationsverarbeitung und Kybernetik (EIK Journal of Information Processing and Cybernetics), vol.17, pp.121-139, 1981.

E. Chul and . Kim, On cellular straight line segments, Computer Graphics and Image Processing, vol.18, pp.369-381, 1982.

R. Klette, A. Rosenfeld, and F. Sloboda, Advances in Digital and Computational Geometry, 1998.

A. Rosenfeld and C. Kim, How a Digital Computer Can Tell Whether a Line is Straight, The American Mathematical Monthly, vol.89, issue.4, pp.230-235, 1982.
DOI : 10.2307/2320219

A. Rosenfeld and R. Klette, Digital Straightness, Electronic Notes in Theoretical Computer Science, vol.46, 2001.
DOI : 10.1016/S1571-0661(04)80976-9

A. Rosenfeld, Digital Straight Line Segments, IEEE Transactions on Computers, vol.23, issue.12, pp.1264-1269, 1974.
DOI : 10.1109/T-C.1974.223845

P. Stephenson and B. Litow, Why step when you can run? Iterative line digitization algorithms based on hierarchies of runs, IEEE Computer Graphics and Applications, pp.76-84, 2000.

P. Stephenson, The Structure of the Digitised Line: With Applications to Line Drawing and Ray Tracing in Computer Graphics, 1998.