Scribd Logo
Upload

Welcome to Scribd!

  • DDA Line Drawing K Steps Yk+1 (Xk+1, Yk+1) 0 10 (20,10)

    Uploaded by

    gattus123
    4 views2 pages
    This document describes the Bresenham line drawing algorithm. It shows the algorithm calculating the next point on a line from an initial point of (20,10) to a final point of (21,11). The algorithm uses integer arithmetic to calculate each new point with integer coordinates rather than using floating point values.

    Original Description:

    Original Title

    example

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes the Bresenham line drawing algorithm. It shows the algorithm calculating the next point on a line from an initial point of (20,10) to a final point of (21,11). The algorithm uses integer arithmetic to calculate each new point with integer coordinates rather than using floating point values.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views2 pages

    DDA Line Drawing K Steps Yk+1 (Xk+1, Yk+1) 0 10 (20,10)

    Uploaded by

    gattus123
    This document describes the Bresenham line drawing algorithm. It shows the algorithm calculating the next point on a line from an initial point of (20,10) to a final point of (21,11). The algorithm uses integer arithmetic to calculate each new point with integer coordinates rather than using floating point values.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    DDA line drawing

    k=steps Yk+1 (Xk+1,Yk+1)


    0 10 (20,10)
    bresenham line algo
    k Pk (Xk+1,Yk+1)
    0 8 (21,11)

    You might also like