Multiple segment line scan-conversion

Computer Graphics Forum

Volumn 16, Issue 5, 1997, Pages 257-268

  Chen, Jim X ^a  

^a George Mason University   (United States)

Author keywords

GCD Table; Line; Pixel Segment; Rasterization; Scan convertion

Indexed keywords

ALGORITHMS; COMPUTER HARDWARE; IMAGE SEGMENTATION;

PIXEL SEGMENTS; SCAN CONVERSION;

COMPUTER GRAPHICS;

EID: 0031382617     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00193     Document Type: Article

References (25)

1. J. E. Bresenham, "Algorithm for Computer Control of Digital Plotter", IBM Syst. J., 4, pp. 25-30 (1965).
2. M. R. Kappel, "An Ellipse-Drawing Algorithm for Raster Displays", in Earnshaw, R. Ed. Fundamental Algorithms for Computer Graphics, NATO ASI Series, Springer-Verlag, Berlin, pp. 257-280 (1985).
3. G. B. Region, "Digital Computer Transformations for Irregular Line Drawings", Tech. Rep., Dept. of EE and CS. New York Univ., pp. 403-422 (April 1972).
4. Y. Suenaga, T. Kamae, and T. Kobayashi, "A High-Speed Algorithm for the Generation of Straight Lines and Circular Arcs", IEEE Trans. Computer, C-28(10), pp. 728-736 (1979).
5. W. E. Wright, "Parallelization of Bresenham's Line and Circle Algorithms", IEEE CG&A, 10(5), pp. 60-67 (September 1990).
6. X. Wu and J. G. Rokne, "Double-Step Incremental Generation of Lines and Circles", Comput. Vision, Gr. Image Process. 37(3), pp. 331-344 (1987).
7. P. L. Gardner, "Modifications of Bresenham's Algorithm for Display". IBM Tech. Disclosure Bull. 18. pp. 1595-1596 (1975).
8. J. E. Bresenham, "Ambiguities in Incremental Line Rastering", IEEE CG&A, 7(5), pp. 31-43 (May 1987).
9. J. Botothroyd and P. A. Hamilton, "Exactly Reversible Plotter Paths", Australian Comput. J., 2, pp. 0-21 (1992).
10. J. E. Bresenham, D. G. Grice, and S. C. Pi, "Run Length Slice Algorithms for Incremental Lines", IBM Technical Disclosure Bulletin, 22-813(1), pp. 3744-3747 (1980).
11. J. E. Bresenham, "Incremental Line Compaction", Comput. J., 25(1), pp. 116-120 (1982).
12. J. E. Bresenham, "Run Length Slice Algorithms for Incremental Lines", Fundamental Algorithms for Computer Graphics, Earnshaw R. A., Ed., NATO ASI Series, Springer Verlag, New York, pp. 59-104 (1985).
13. R. F. Sproull, "Using Program Transformations to Derive Line-Drawing Algorithms", ACM trans. Gr., 1(10), pp. 259-273 (1982).
14. G. Bao and J. G. Rokne, "Quadruple-step Line Generation", Computers & Graphics, 13(4), pp. 61-469 (1989).
15. G. W. Gill, "N-Step Incremental Straight-Line Algorithms", IEEE CG&A, 5, pp. 66-72 (1994).
16. J. G. Rokne, B. Wyvill, et al., "Fast Line Scan-Conversion", ACM Trans. on Graphics, 9(4), pp. 376-388 (October 1990).
17. E. Angel and D. Morrison, "Short Note: Speeding Up Bresenham's Algorithm", IEEE CG&A, 11, pp. 16-17 (1991).
18. R. Brons, "Linguistic Methods for the Description of Straight Line on a Grid", Comput. Gr. Image Process., 9, pp. 183-195 (1979).
19. C. M. A. Castle and M. L. V. Pitteway, "An Application of Euclid's Algorithm to Drawing Straight Lines", Fundamental Algorithms for Computer Graphics, NATO ASI F17, Springer-Verlag, pp. 134-139 (1985).
20. C. M. A. Castle and M. L. V. Pitteway, "An Efficient Structural Technique for Encoding best-fit Straight Lines", Comput. J., 30, pp. 168-175 (1987).
21. M. D. Mcllory, "A Note on Discrete Representation of Lines", AT&T Tech. J., 64(2), pp. 481-490 (1985).
22. A. Pang, "Line-drawing Algorithms for Parallel Machines", IEEE CG&A, 10(9), pp. 54-59 (1990).
23. M. L. V. Pitteway and A. Green, "Bresenham's Algorithm with Run Line Code Shortcut", Comput. J., 25, pp. 259-273 (1982).
24. Tran-Thong, "A Symmetric Linear Algorithm for Line Segment Generations", Computer & Graphics, 6(1), pp. 15-17 (January 1982).
25. J. D. Foley, A. van Dam, S. K. Feiner, and J. F. Hughes, Computer Graphics: Principles and Practice, Second Edition in C, Addison Wesley (1996).