Scribd Logo
Upload

Welcome to Scribd!

  • 52 views

    How Does Computer Draw Line?: - Screen Made of Pixels - High-Level Language Specifies Line - System Must Color Pixels

    Uploaded by

    Sonu Soman Pournami
    The document describes two algorithms for drawing lines on a pixel-based screen: DDA and Bresenham's. DDA uses floating point calculations to determine which pixel to color at each step, requiring rounding. Bresenham's uses only integer calculations by tracking the error between ideal and actual pixel positions. It performs fewer operations per step than DDA by avoiding floating point.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd

    How Does Computer Draw Line?: - Screen Made of Pixels - High-Level Language Specifies Line - System Must Color Pixels

    Uploaded by

    Sonu Soman Pournami
    52 views10 pages
    The document describes two algorithms for drawing lines on a pixel-based screen: DDA and Bresenham's. DDA uses floating point calculations to determine which pixel to color at each step, requiring rounding. Bresenham's uses only integer calculations by tracking the error between ideal and actual pixel positions. It performs fewer operations per step than DDA by avoiding floating point.

    Original Description:

    Original Title

    line algm

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes two algorithms for drawing lines on a pixel-based screen: DDA and Bresenham's. DDA uses floating point calculations to determine which pixel to color at each step, requiring rounding. Bresenham's uses only integer calculations by tracking the error between ideal and actual pixel positions. It performs fewer operations per step than DDA by avoiding floating point.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    52 views10 pages

    How Does Computer Draw Line?: - Screen Made of Pixels - High-Level Language Specifies Line - System Must Color Pixels

    Uploaded by

    Sonu Soman Pournami
    The document describes two algorithms for drawing lines on a pixel-based screen: DDA and Bresenham's. DDA uses floating point calculations to determine which pixel to color at each step, requiring rounding. Bresenham's uses only integer calculations by tracking the error between ideal and actual pixel positions. It performs fewer operations per step than DDA by avoiding floating point.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 10

    How does computer draw line?

    Screen made of pixels High-level language specifies line System must color pixels

    DDA Algorithm
    Start with starting and ending coordinates of the line:
    (x0, y0) and (x1, y1)

    Color first pixel (round to nearest integer) Suppose x1-x0 > y1-y0 (gentle slope)
    There will be x1-x0 steps (# pixels to be colored)

    Set x=x0, y=y0 At each step,


    increment x by (x1-x0)/numsteps, and increment y by (y1-y0)/numsteps

    For each step, round off x and y to nearest integer, and color pixel

    DDA Pseudo-code
    // assume that slope is gentle DDA(float x0, float x1, float y0, float y1) { float x, y; float xinc, yinc; int numsteps; numsteps = Round(x1) Round(x0); xinc = (x1 x0) / numsteps; yinc = (y1 y0) / numsteps; x = x0; y = y0; ColorPixel(Round(x),Round(y)); for (int i=0; i<numsteps; i++) { x += xinc; y += yinc; ColorPixel(Round(x),Round(y)); } }

    Q: For each step, how many floating point operations are there? A: 4 Q: For each step, how many integer operations are there? A: 2

    DDA Example
    Suppose we want to draw a line starting at pixel (2,3) and ending at pixel (12,8). What are the values of the variables x and y at each timestep? What are the pixels colored, according to the DDA algorithm?
    numsteps = 12 2 = 10 xinc = 10/10 = 1.0 yinc = 5/10 = 0.5 t 0 1 2 3 4 5 6 7 8 9 10 x 2 3 4 5 6 7 8 9 10 11 12 y 3 3.5 4 4.5 5 5.5 6 6.5 7 7.5 8 R(x) 2 3 4 5 6 7 8 9 10 11 12 R(y) 3 4 4 5 5 6 6 7 7 8 8

    DDA Algorithm (continued)

    Y_inc

    X_inc

    but floating point operations and rounding operations are expensive

    Bresenhams Algorithm
    Uses only integer calculations Uses distance between ideal y-coordinate and the upper and lower pixel (assuming gentle slope)

    dupper dlower

    General idea how Bresenham works


    Suppose that the line is gently sloping upwards from left to right. Start by coloring the left-most pixel. Then, for the next column (that is, for each x value), we have to figure out whether we color the same y or y+1. How do we decide?
    When going from one column to the next, add an error value. If the error value is more than 0.5, we should color y+1 and reset the error value. Otherwise, color y and accumulate the error value.

    However, it seems like were still using floating point


    Solution, multiply both sides by 2 so that we use integer comparisons instead.

    Bresenhams Algorithm
    1. 2. 3. 4. 5. Input the two line endpoints and store left endpoint as (x0,y0) Pre-calculate the values dx, dy, 2dy and 2dy - 2dx Color pixel (x0,y0) Let p0 = 2dy dx At each xk along the line, starting with k=0: If pk<0, then the next point to plot is (xk + 1,yk), and pk+1 = pk + 2dy

    Otherwise, the next point to plot is (xk + 1, yk + 1), and pk+1 = pk + 2dy 2dx
    6. Repeat Step-4 dx times

    Switch Point 0 and Point 1 if necessary If negative slope, reflect If steep slope, flip y and x

    Number of Operations in Bresenhams Algorithm


    Q: In each step, how many floating point operations are there? A: 0
    Q: In each step, how many integer operations are there? A: 3 or 4

    Bresenhams Algorithm Example


    Suppose we want to draw a line starting at pixel (2,3) and ending at pixel (12,8). What are the values of p0, dx and dy? What are the values of the variable p at each timestep? What are the pixels colored, according to Bresenhams algorithm?
    dx = 12 2 = 10 dy = 8 3 = 5 p0 = 2dy dx = 15 t 0 1 2 3 p 0 -10 0 -10 P(x) 2 3 4 5 2dy = 10 2dy 2dx = -10 P(y) 3 4 4 5

    4
    5 6 7 8 9 10

    0
    -10 0 -10 0 -10 0

    6
    7 8 9 10 11 12

    5
    6 6 7 7 8 8

    You might also like