Abstract
Two distinct approaches exist for the generation of a straight line in an arbitrary direction on a lattice, structural algorithms and conditional algorithms. A survey of these approaches is included in this paper.
Structural algorithms are of great theoretical value. From numbertheory the Farey-series can be used for directions on a lattice with a rational slope. With continued fractions it is also possible to approximate irrational numbers.
Knowing these properties it is possible to determine the set of all lines corresponding to a given chaincode for a segment of a line. This is useful for the estimation of properties of a line like length, slope and intercept. Research of this kind is related to pattern analysis and picture processing.
The structural algorithm can be presented by linguistic methods, for instance a context-free programmed grammar and a TOL-grammar, a variant of the Lindenmayer grammar with the important property that in each derivation each relevant symboltype in a string is rewritten at the same time by the same rule.
The principle of the conditional algorithm is more practical: given two points that determine the line, connected points on the lattice with minimal distance to the real line have to be selected. This method is very important for plotters and computer graphics displays.
The conditional algorithm can be presented by linguistic methods too, by using a programmed grammar with a tail. The tail has a bookkeeping function. Consequentially the grammar is context-sensitive.
Structural and conditional methods both generate lines satisfying the chord property, which is a conditional property. A structural property of a digitized straight line is spacing the least occurring type of chainelement as uniformly as possible. It is shown that this can be built into a conditional method. So an integration between both methods is achieved.
Finally some remarks on progress in the science of line drawing are made.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Arcelli and A. Massarotti, On the parallel generation of straight digital lines, Comp. Grap. Image Process., 7, 1978, 67–83.
J.E. Bresenham, Algorithm for computer control of a digital plotter, IBM Syst. J., 4, 1965, 25–30.
J.E. Bresenham, Incremental line compaction, Computer Journal, 25, 1982, 116–120.
R. Brons, Linguistic methods for the description of a straight line on a grid, Comp. Grap. Image Process., 3, 1974, 48–62.
J.T. Butler, On the relationship between propagating contextdependent Lindenmayer systems and cellular automata systems, Information Sciences, 68, 1982, 63–67.
R.L.T. Cederberg, A new method for vector generation, Comp.Grap. Image Process., 9, 1979, 183–195.
L. Dorst and R.P.W. Duin, Spirograph Theory: a framework for calculations on digitized straight lines, IEEE Trans. Pattern Anal. Machine Intell., PAMI-6, 1984, 632–639.
L. Dorst and A.W.M. Smeulders, Discrete representation of straight lines, IEEE Trans. Pattern Anal. Machine Intell., PAMI-6, 1984, 450–463.
L. Dorst and A.W.M. Smeulders, Best linear unbiased estimators for properties of digitized straight lines, internal report Technical University Delft, the Netherlands, 1984.
R.A. Earnshaw, Line tracking for incremental plotters, Computer Journal, 23, 1980, 46–52.
H. Freeman, Boundary encoding and processing, in Picture processing and psychopictorics, B.S. Lipkin and A. Rosenfeld, Eds., New York, Academic, 1970, 241–266.
K.S. Fu, Syntactic Pattern recognition and applications, Englewood Cliffs, N.J., Prentice Hall, 1982.
G.H. Hardy and E.M. Wright, An introduction to the theory of numbers, 4th ed., London, Oxford at the Clarendon, 1960.
G.T. Herman and G. Rozenberg, Development systems and languages, Amsterdam, North-Holland, 1975.
S.H.Y. Hung and T. Kasvand, On the chord property and its equivalances, Proceedings 7th Int. Conf. on Pattern Recogn., Montreal, 1984, 116–119.
J. Jelinek, An algebraic theory for parallel processor design, Computer Journal, 22, 1979, 363–375.
C.E. Kim and A. Rosenfeld, Digital straight lines and convexity of digital regions, IEEE Trans. Pattern Anal. Machine Intell., PAMI-4, 1982, 149–153.
C.E. Kim, On cellular straight line segments, Comp. Grap. Image Process., 18, 1982, 369–381.
C.E. Kim, Digital convexity, straightness and convex polygons, IEEE Trans. Pattern Anal. Machine Intell., PAMI4, 1982, 618–626.
H.C. Lee and K.S. Fu, Using the FFT to determine digital straight line chain codes, Comp. Grap. Image Process., 18, 1982, 359–368.
H.F. Moed, W.J.M. Burger, J.G. Frankfort and A.F.J. van Raan, On the measurement of research performance, the use of bibliometric indicators, internal report Research policy unit OWZ/PISA, State University of Leiden, The Netherlands, 1983. Presented at the 6th Forum of European AIR member’s “Beyond retrenchment: planning for quality and efficiency”, Brussels, august 1984. (Proceedings p.p. 23–32 ).
S.P. Morse, Computer storage of contour-map data, Proceedings 1968 ACM Nat. Conf., 1968, 45–51.
M.L.V. Pitteway and A.J.R. Green, Bresemham’s algorithm with run line coding shortcut, Computer Journal, 25, 1982, 114–115.
G.B. Reggiori, Digital computer transformations for irregular line drawings, Technical report 403–22, New York University, 1972. Available from US Departement of Commerce as AD-745–015.
A. Rosenfeld, Digital straight line segments, IEEE Trans. Comp., C-23, 1974, 1264–1269.
A. Rosenfeld and C.E. Kim, How a digital computer can tell whether a line is straight, The Americal Mathematical Monthly, 89, 1982, 230–235.
A. Rosenfeld, A.Y. Wu and T. Dubitzki, Fast Language acceptance by shrinking cellular automata, Information Sciences, 30, 1983, 47–53.
J. Rothstein and C. Weiman, Parallel and sequential specification of a context sensitive language for straight lines on grids, Comp. Grap. Image Process., 5, 1976, 106–124.
S. Schlien, Segmentation of digital curves using linguistic techniques, Comp. Vis. Grap. Image Process., 22, 1983, 277–286.
R.F. Sproull, Using program transformations to derive line-drawing algorithms, ACM Trans. Graph., 1, 1982, 259273
G.Y. Tang and T.S. Huang, A Syntactic-semantic approach to image understanding and creation, IEEE Trans. Pattern Anal. Machine Intell., PAMI-1, 1979, 135–144.
J.R. Thompson, Straight lines and graph plotters, Computer Journal, 4, 1964, 227.
A.M. Vossepoel and A.W.M. Smeulders, Vector code probability and metrication error in the representation of straight lines of finite length, Comp. Grap. Image Process., 20, 1982, 347–364.
L.D. Wu, On the chaincode of a line, IEEE Trans. Pattern Anal. Machine Intell., PAMI-4, 1982, 347–353.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brons, R. (1985). Theoretical and Linguistic Methods for Describing Straight Lines. In: Earnshaw, R.A. (eds) Fundamental Algorithms for Computer Graphics. NATO ASI Series, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84574-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-84574-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54397-8
Online ISBN: 978-3-642-84574-1
eBook Packages: Springer Book Archive