Phil Graham
ABSTRACT
A method of increasing the efficiency of line drawing algorithms by setting additional pixels during loop iterations is presented in this paper. This method adds no additional costs to the loop. It is applied here to the double-step algorithm presented in [15] and later used in [14], resulting in up to a thirty-three percent reduction in the number of iterations and a sixteen percent increase in speed. In addition, the code complexity and initialization costs of the resulting algorithm remain the same.
- 1.P. Bao and J. Rokn~. Quadruple-step line generation, Computers & Graphics 13(4), 461-469 (1989).Google Scholar
Cross Ref
- 2.J.E. Brcsenham. Algorithm for computer control of a digital plotter, IBM Systems Journal 4(I), 25-30 (1965).Google ScholarDigital Library
- 3.J.E. Bresenham. Incremental line compaction, Computer Journal 25(i), 116-120 (1982).Google Scholar
- 4.J.E. Bresenham. Run length slice algorithm for incremental lines, in Fundamental Algorithms for Computer Graphics (R.A. Earnshaw, Ed.), NATO ASI Series, Springer-Verlag: New York, 59-104 (1985).Google ScholarCross Ref
- 5.G. Casciola. Basic concepts to accelerate line algorithms, Computers & Graphics 12(3/4), 489-502 (1988).Google ScholarCross Ref
- 6.C.M.A. Castle and M.L.V. Pitteway. An application of Euclid's algorithm to drawing straight lines, in Fundamental Algorithms for Computer Graphics (R.A. Earnshaw, Ed.), NATO ASI Series, Springer Verlag: New York, 135-139 (1985).Google ScholarCross Ref
- 7.C.M.A. Castle and M.L.V. Pitteway. An efficient structural technique for encoding 'best-fit' straight lines, Computer Journal 30(2), 168-175 (1987). Google ScholarDigital Library
- 8.H. Freeman. Boundary encoding and processing, in Picture Processing and Psychopictorics (B.S. Lipkin and A. Rosenfeld, Eds.), Academic Press: New York, 241-266 (1970).Google Scholar
- 9.H. Freeman. On the encoding of arbitrary geometric configurations, IRE Trans. EC-102, 260-268 (1961).Google ScholarCross Ref
- 10.A. Fujimoto, T. Tanaka, and K. Iwata. ARTS: Accelerated Ray-Tracing System, IEEE CG&A 6(4), 16-26 (1986). Google ScholarDigital Library
- 11.P.L. Gardner. Modifications of Brcsenham's algorithm for displays, IBM Tech. Disclosure Bull. 18(5), 1595-1596(1975).Google Scholar
- 12.M.L.V. Pitteway and Aj.R. Green. Bresenham's algorithm with run line coding shortcut, Computer Journal 25(1), 114-115 (1982).Google ScholarCross Ref
- 13.G.B. Regiori. Digital computer transformations for irregular line drawings, Tech. Rep. 403-22, Department of Electrical Engineering and Computer Science, New York Univ., April 1972.Google Scholar
- 14.J.G. Rokn~, B. Wyvill, and X. Wu. Fast line scanconversion, ACId Transactions on Graphics 9(4), 376-388 (1990). Google ScholarDigital Library
- 15.X. Wu and I.G. Rokne. Double-step incremental generation of lines and circles, Computer Vision, Graphics, and Image Processing 37(3), 331-344 (1987). Google ScholarDigital Library
Index Terms
- Double- and triple-step incremental generation of lines
Recommendations
Double-step incremental linear interpolation
A two-step incremental linear interpolation algorithm is derived and analyzed. It is shown that the algorithm is correct, that it is reversible, and that it is faster than previous single-step algorithms. An example is given of the execution of the ...
Double- and Triple-Step Incremental Linear Interpolation
Incremental linear interpolation determines the set of n+1 equidistant points on an interval [a,b] where all variables involved (n, a, b, and the set of equidistant points) are integers and n<0. Our method of linear interpolation generalizes the ...
N-Step Incremental Straight-Line Algorithms
This class of algorithms extends Bresenham's (1965) integer straight-line algorithm to generate more than one pixel per inner loop, thus reducing inner loop overhead. The quad-step algorithm is too large to justify its use in older hardware with limited ...
Comments