Scribd
Upload
68 views

Lecture 4 Scan Conversion Bresenhams Algorithm

The Bresenham line algorithm is an incremental line drawing algorithm that uses only integer calculations. It works by calculating a decision parameter to determine whether to plot pixels above or below the true line at each increment along the x-axis. This avoids rounding errors compared to the DDA algorithm. The key steps are to calculate constants like Δx, Δy, initialize the decision parameter p0, then incrementally calculate pk+1 from pk to march along the line plotting pixels.

Uploaded by

Dyuti Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
68 views

Lecture 4 Scan Conversion Bresenhams Algorithm

The Bresenham line algorithm is an incremental line drawing algorithm that uses only integer calculations. It works by calculating a decision parameter to determine whether to plot pixels above or below the true line at each increment along the x-axis. This avoids rounding errors compared to the DDA algorithm. The key steps are to calculate constants like Δx, Δy, initialize the decision parameter p0, then incrementally calculate pk+1 from pk to march along the line plotting pixels.

Uploaded by

Dyuti Islam
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 16

Contents

In today’s lecture we’ll have a look at:


– Bresenham’s line drawing algorithm
The Bresenham Line Algorithm
The Bresenham algorithm is
another incremental scan
conversion algorithm
The big advantage of this
algorithm is that it uses only
integer calculations
Jack Bresenham
worked for 27 years at
IBM before entering
academia. Bresenham
developed his famous
algorithms at IBM in
the early 1960s
The Big Idea
Move across the x axis in unit intervals and
at each step choose between two different y
coordinates
For example, from
5
(x +1, y +1)
position (2, 3) we
have to choose
k k

4
(x , y )
k k
between (3, 3) and
3 (3, 4)
(x +1, y )
We would like the
k k

2
point that is closer to
2 3 4 5
the original line
Deriving The Bresenham Line Algorithm

At sample position xk+1y


k+1
the vertical separations dupper
y
from the mathematical dlower
yk
line are labelled dupper
and dlower xk+1
The y coordinate on the mathematical line at
xk+1 is:
y  m( xk  1)  b
Deriving The Bresenham Line Algorithm
(cont…)
So, dupper and dlower are given as follows:
d lower  y  yk
 m( xk  1)  b  yk
and:
d upper  ( yk  1)  y
 yk  1  m( xk  1)  b
We can use these to make a simple decision
about which pixel is closer to the mathematical
line
Deriving The Bresenham Line Algorithm
(cont…)
This simple decision is based on the difference
between the two pixel positions:
d lower  d upper  2m( xk  1)  2 yk  2b  1
Let’s substitute m with ∆y/∆x where ∆x and
∆y are the differences between the end-points:
y
x(d lower  d upper )  x(2 ( xk  1)  2 yk  2b  1)
x
 2y  xk  2x  yk  2y  x(2b  1)

 2y  xk  2x  yk  c
Deriving The Bresenham Line Algorithm
(cont…)
So, a decision parameter pk for the kth step
along a line is given by:
pk  x(d lower  d upper )
 2y  xk  2x  yk  c
The sign of the decision parameter pk is the
same as that of dlower – dupper
If pk is negative, then we choose the lower
pixel, otherwise we choose the upper pixel
Deriving The Bresenham Line Algorithm
(cont…)
Remember coordinate changes occur along
the x axis in unit steps so we can do
everything with integer calculations
At step k+1 the decision parameter is given
as:
pk 1  2y  xk 1  2x  yk 1  c
Subtracting pk from this we get:
pk 1  pk  2y ( xk 1  xk )  2x( yk 1  yk )
Deriving The Bresenham Line Algorithm
(cont…)
But, xk+1 is the same as xk+1 so:
pk 1  pk  2y  2x( yk 1  yk )
where yk+1 - yk is either 0 or 1 depending on
the sign of pk
The first decision parameter p0 is evaluated
at (x0, y0) is given as:
p0  2y  x
The Bresenham Line Algorithm
BRESENHAM’S LINE DRAWING ALGORITHM
(for |m| < 1.0)
1. Input the two line end-points, storing the left end-point
in (x0, y0)
2. Plot the point (x0, y0)
3. Calculate the constants Δx, Δy, 2Δy, and (2Δy - 2Δx)
and get the first value for the decision parameter as:
p0  2y  x
4. At each xk along the line, starting at k = 0, perform the
following test. If pk < 0, the next point to plot is
(xk+1, yk) and:
pk 1  pk  2y
The Bresenham Line Algorithm (cont…)

Otherwise, the next point to plot is (xk+1, yk+1) and:


pk 1  pk  2y  2x
5. Repeat step 4 (Δx – 1) times

Attention! The algorithm and derivation


above assumes slopes are less than 1. for
other slopes we need to adjust the algorithm
slightly.
Bresenham Example
Let’s have a go at this
Let’s plot the line from (20, 10) to (30, 18)
First off calculate all of the constants:
– Δx: 10
– Δy: 8
– 2Δy: 16
– 2Δy - 2Δx: -4
Calculate the initial decision parameter p0:
– p0 = 2Δy – Δx = 6
Bresenham Example (cont…)

18 k pk (xk+1,yk+1)

17 0

16 1

15 2
3
14
4
13
5
12
6
11
7
10
8
20 21 22 23 24 25 26 27 28 29 30 9
Bresenham Exercise
Go through the steps of the Bresenham line
drawing algorithm for a line going from
(21,12) to (29,16)
Bresenham Exercise (cont…)

18 k pk (xk+1,yk+1)

17 0
16 1

15 2

14 3

13 4
5
12
6
11
7
10
8
20 21 22 23 24 25 26 27 28 29 30
Bresenham Line Algorithm Summary

The Bresenham line algorithm has the following


advantages:
– A fast incremental algorithm
– Uses only integer calculations
Comparing this to the DDA algorithm, DDA has the
following problems:
– Accumulation of round-off errors can make the
pixelated line drift away from what was intended
– The rounding operations and floating point arithmetic
involved are time consuming

You might also like