메뉴 건너뛰기




Volumn 18, Issue 1, 1999, Pages 69-78

Approximate line scan-conversion and antialiasing

(2)  Chen, Jim X a   Wang, Xusheng a  

a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANTI-ALIASING; APPROXIMATION THEORY; COMPUTER SIMULATION; IMAGE QUALITY; RANDOM PROCESSES;

EID: 0032658728     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: 10.1111/1467-8659.00303     Document Type: Article
Times cited : (6)

References (31)
  • 1
    • 0002310616 scopus 로고
    • Short note: Speeding up Bresenham's algorithm
    • E. Angel and D. Morrison, "Short Note: Speeding Up Bresenham's Algorithm,", IEEE CG&A, 11, pp. 16-17 (1991).
    • (1991) IEEE CG&A , vol.11 , pp. 16-17
    • Angel, E.1    Morrison, D.2
  • 2
    • 0002349614 scopus 로고
    • Algorithm for computer control of digital plotter
    • J. E. Bresenham, "Algorithm for Computer Control of Digital Plotter", IBM Syst. J., 4, pp. 25-30 (1965).
    • (1965) IBM Syst. J. , vol.4 , pp. 25-30
    • Bresenham, J.E.1
  • 3
    • 0020088280 scopus 로고
    • Incremental line compaction
    • J. E. Bresenham, "Incremental Line Compaction", Comput. J., 25(1), pp. 116-120 (1982).
    • (1982) Comput. J. , vol.25 , Issue.1 , pp. 116-120
    • Bresenham, J.E.1
  • 4
    • 0004235973 scopus 로고
    • Run length slice algorithms for incremental lines
    • J. E. Bresenham, D. G. Grice, and S. C. Pi, "Run Length Slice Algorithms for Incremental Lines", IBM Technical Disclosure Bulletin, 22-8B(1), pp. 3744-3747 (1980).
    • (1980) IBM Technical Disclosure Bulletin , vol.22-28 B , Issue.1 , pp. 3744-3747
    • Bresenham, J.E.1    Grice, D.G.2    Pi, S.C.3
  • 5
    • 0022174943 scopus 로고
    • Run length slice algorithms for incremental lines
    • R. A. Earnshaw, Ed., NATO ASI Series, F17, Springer-Verlag, New York
    • J. E. Bresenham, "Run Length Slice Algorithms for Incremental Lines", Fundamental Algorithms for Computer Graphics, R. A. Earnshaw, Ed., NATO ASI Series, F17, Springer-Verlag, New York, pp. 59-104 (1985).
    • (1985) Fundamental Algorithms for Computer Graphics , pp. 59-104
    • Bresenham, J.E.1
  • 6
    • 0023345058 scopus 로고
    • Ambiguities in incremental line rastering
    • May
    • J. E. Bresenham, "Ambiguities in Incremental Line Rastering", IEEE CG&A, 7(5), pp. 31-43 (May 1987).
    • (1987) IEEE CG&A , vol.7 , Issue.5 , pp. 31-43
    • Bresenham, J.E.1
  • 7
    • 0029776088 scopus 로고    scopus 로고
    • Tutorial: Pixel-processing fundamentals
    • J. E. Bresenham, "Tutorial: Pixel-Processing Fundamentals", IEEE CG&A, 16(1), pp. 74-82 (1996).
    • (1996) IEEE CG&A , vol.16 , Issue.1 , pp. 74-82
    • Bresenham, J.E.1
  • 8
    • 0011821867 scopus 로고
    • Linguistic methods for the description of straight line on a grid
    • R. Brons, "Linguistic Methods for the Description of Straight Line on a Grid", Comput. Gr. Image Process., 9, pp. 183-195 (1979).
    • (1979) Comput. Gr. Image Process. , vol.9 , pp. 183-195
    • Brons, R.1
  • 10
    • 0004316873 scopus 로고
    • An application of Euclid's algorithm to drawing straight lines
    • R. A. Earnshaw, Ed., NATO ASI F17, Springer-Verlag, New York
    • C. M. A. Castle and M. L. V. Pitteway, "An Application of Euclid's Algorithm to Drawing Straight Lines", Fundamental Algorithms for Computer Graphics, R. A. Earnshaw, Ed., NATO ASI F17, Springer-Verlag, New York, pp. 134-139 (1985).
    • (1985) Fundamental Algorithms for Computer Graphics , pp. 134-139
    • Castle, C.M.A.1    Pitteway, M.L.V.2
  • 11
    • 0023327035 scopus 로고
    • An efficient structural technique for encoding best-fit straight lines
    • 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).
    • (1987) Comput. J. , vol.30 , pp. 168-175
    • Castle, C.M.A.1    Pitteway, M.L.V.2
  • 12
    • 0031382617 scopus 로고    scopus 로고
    • Multiple segment line scanconversion
    • J. X. Chen, "Multiple Segment Line ScanConversion", Computer Graphics Forum, 16(5), pp. 257-268 (1997).
    • (1997) Computer Graphics Forum , vol.16 , Issue.5 , pp. 257-268
    • Chen, J.X.1
  • 13
    • 24544445744 scopus 로고    scopus 로고
    • Approximate line scan-conversion and its hardware design
    • George Mason University
    • J. X. Chen, and X. Wang, "Approximate Line Scan-Conversion and its Hardware Design", Technical Report, TR98-3, George Mason University, (http://www.cs.gmu.edu:8080/).
    • Technical Report , vol.TR98-3
    • Chen, J.X.1    Wang, X.2
  • 14
    • 0017556297 scopus 로고
    • The aliasing problem in computer-generated shaded images
    • F. C. Crow, "The Aliasing Problem in Computer-Generated Shaded Images", Communications of the ACM, 20(11), pp. 799-805 (1977).
    • (1977) Communications of the ACM , vol.20 , Issue.11 , pp. 799-805
    • Crow, F.C.1
  • 16
    • 0021499890 scopus 로고
    • Spirograph theory: A framework for calculations on digitized straight lines
    • September
    • 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(5), pp. 632-639 (September 1984).
    • (1984) IEEE Trans. Pattern Anal. Machine Intell. , vol.PAMI-6 , Issue.5 , pp. 632-639
    • Dorst, L.1    Duin, R.P.W.2
  • 17
    • 0004361011 scopus 로고
    • Line tracking for incremental plotters
    • R. A. Earnshaw, "Line Tracking for Incremental Plotters", Comput. J., 23(1), pp. 47-52 (1980).
    • (1980) Comput. J. , vol.23 , Issue.1 , pp. 47-52
    • Earnshaw, R.A.1
  • 19
    • 0004354718 scopus 로고
    • Modifications of Bresenham's algorithm for display
    • P. L. Gardner, "Modifications of Bresenham's Algorithm for Display", IBM Tech. Disclosure Bull. 18, pp. 1595-1596 (1975).
    • (1975) IBM Tech. Disclosure Bull. , vol.18 , pp. 1595-1596
    • Gardner, P.L.1
  • 20
    • 0345521585 scopus 로고
    • N-step incremental straight-line algorithms
    • G. W. Gill, "N-Step Incremental Straight-Line Algorithms", IEEE CG&A, 5, pp. 66-72 (1994).
    • (1994) IEEE CG&A , vol.5 , pp. 66-72
    • Gill, G.W.1
  • 24
    • 0022015324 scopus 로고
    • A note on discrete representation of lines
    • M. D. McIlory, "A Note on Discrete Representation of Lines", AT&T Tech. J., 64(2), pp. 481-490 (1985).
    • (1985) AT&T Tech. J. , vol.64 , Issue.2 , pp. 481-490
    • McIlory, M.D.1
  • 25
    • 0004361273 scopus 로고
    • Bresenham's algorithm with run line code shortcut
    • M. L. V. Pitteway and A. Green, "Bresenham's Algorithm with Run Line Code Shortcut", Comput. J., 25, pp. 114-115 (1982).
    • (1982) Comput. J. , vol.25 , pp. 114-115
    • Pitteway, M.L.V.1    Green, A.2
  • 26
  • 27
    • 0025505022 scopus 로고
    • Fast line scanconversion
    • October
    • J. G. Rokne, B. Wyvill, et al., "Fast Line ScanConversion", ACM Trans. on Graphics, 9(4), pp. 376-388 (October 1990).
    • (1990) ACM Trans. on Graphics , vol.9 , Issue.4 , pp. 376-388
    • Rokne, J.G.1    Wyvill, B.2
  • 28
    • 0004331053 scopus 로고
    • Digital computer transformations for irregular line drawings
    • Dept. of EE and ES. New York Univ., April
    • G. B. Regiori, "Digital Computer Transformations for Irregular Line Drawings", Tech. Rep., Dept. of EE and ES. New York Univ., pp. 403-422 (April 1972).
    • (1972) Tech. Rep. , pp. 403-422
    • Regiori, G.B.1
  • 29
    • 33744836792 scopus 로고
    • Using program transformations to derive line-drawing algorithms
    • R. F. Sproull, "Using Program Transformations to Derive Line-Drawing Algorithms", ACM trans. Gr., 1(10), pp. 259-273 (1982).
    • (1982) ACM Trans. Gr. , vol.1 , Issue.10 , pp. 259-273
    • Sproull, R.F.1
  • 30
    • 0004356382 scopus 로고
    • A symmetric linear algorithm for line segment generations
    • January
    • Tran-Thong, "A Symmetric Linear Algorithm for Line Segment Generations", Computer & Graphics, 6(1), pp. 15-17 (January 1982).
    • (1982) Computer & Graphics , vol.6 , Issue.1 , pp. 15-17
  • 31
    • 0023311330 scopus 로고
    • Double-step incremental generation of lines and circles
    • 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).
    • (1987) Comput. Vision, Gr. Image Process. , vol.37 , Issue.3 , pp. 331-344
    • Wu, X.1    Rokne, J.G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.