Professional Documents
Culture Documents
Computer Graphics 4: Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling
Computer Graphics 4: Bresenham Line Drawing Algorithm, Circle Drawing & Polygon Filling
Bresenham Line
Drawing Algorithm,
Circle Drawing &
Polygon Filling
By:Kanwarjeet Singh
2
of
50
Contents
In todays lecture well have a look at:
Bresenhams line drawing algorithm
Line drawing algorithm comparisons
Circle drawing algorithms
A simple technique
The mid-point circle algorithm
Polygon fill algorithms
Summary of raster drawing algorithms
3
of
50
DDA
Digital differential analyser
Y=mx+c
For m<1
y=mx
For m>1
x=y/m
4
of
50
Question
A line has two end points at (10,10) and
(20,30). Plot the intermediate points using
DDA algorithm.
5
of
50
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
6
of
50
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
(xk+1, yk+1)
position (2, 3) we
4
have to choose
(xk, yk) between (3, 3) and
3 (3, 4)
(xk+1, yk)
2
We would like the
point that is closer to
2 3 4 5
the original line
7
of
50
Deriving The Bresenham Line Algorithm
At sample position
yk+1
xk+1 the vertical dupper
y
separations from the dlower
mathematical line are yk
labelled dupper and dlower xk+1
The y coordinate on the mathematical line at
xk+1 is:
y m( xk 1) b
8
of
Deriving The Bresenham Line Algorithm
50 (cont)
So, dupper and dlower are given as follows:
dlower 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
9
of
Deriving The Bresenham Line Algorithm
50 (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
Lets 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
2y xk 2x yk 2y x(2b 1)
2y xk 2x yk c
10
of
Deriving The Bresenham Line Algorithm
50 (cont)
So, a decision parameter pk for the kth step
along a line is given by:
pk x(dlower d upper )
2y xk 2x 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
11
of
Deriving The Bresenham Line Algorithm
50 (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 2y xk 1 2x yk 1 c
Subtracting pk from this we get:
pk 1 pk 2y( xk 1 xk ) 2x( yk 1 yk )
12
of
Deriving The Bresenham Line Algorithm
50 (cont)
But, xk+1 is the same as xk+1 so:
pk 1 pk 2y 2x( 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 2y x
13
of
50
The Bresenham Line Algorithm
BRESENHAMS 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, 2y, and (2y - 2x)
and get the first value for the decision parameter as:
p0 2y 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 2y
14
of
50
The Bresenham Line Algorithm (cont)
18 k pk (xk+1,yk+1)
17 0
16 1
15 2
14 3
4
13
5
12
6
11
7
10
8
20 21 22 23 24 25 26 27 28 29 30 9
18
of
50
Bresenham Exercise
Go through the steps of the Bresenham line
drawing algorithm for a line going from
(21,12) to (29,16)
19
of
50
Bresenham Exercise (cont)
18 k pk (xk+1,yk+1)
17 0
16 1
15 2
14 3
4
13
5
12
6
11
7
10
8
20 21 22 23 24 25 26 27 28 29 30
20
of
50
Bresenham Line Algorithm Summary
y0 20 2 0 2 20
y1 202 12 20
y2 202 22 20
y19 20 2 19 2 6
y20 20 2 20 2 0
23
of
A Simple Circle Drawing Algorithm
50 (cont)
However, unsurprisingly this is not a brilliant
solution!
Firstly, the resulting circle has large gaps
where the slope approaches the vertical
Secondly, the calculations are not very
efficient
The square (multiply) operations
The square root operation try really hard to
avoid these!
We need a more efficient, more accurate
solution
24
of
50
Polar coordinates
X=r*cos+xc
Y=r*sin+yc
0360
Or
0 6.28(2*)
Problem:
Deciding the increment in
Cos, sin calculations
25
of
50
Eight-Way Symmetry
The first thing we can notice to make our circle
drawing algorithm more efficient is that circles
centred at (0, 0) have eight-way symmetry
(-x, y) (x, y)
(-y, x) (y, x)
R
2
(-y, -x) (y, -x)
1 2 3 4
28
of
50
Mid-Point Circle Algorithm (cont)
M
5
1 2 3 4
29
of
50
Mid-Point Circle Algorithm (cont)
6
M
5
1 2 3 4
30
of
50
Mid-Point Circle Algorithm (cont)
Assume that we have
(xk+1, yk)
just plotted point (xk, yk) (x k , yk )
or:
pk 1 pk 2( xk 1) ( y 2
k 1 y ) ( yk 1 yk ) 1
2
k
10
k pk (xk+1,yk+1) 2xk+1 2yk+1
9
8 0
7
1
6
5 2
4
3
3
2 4
1 5
0
6
0 1 2 3 4 5 6 7 8 9 10
39
of
50
Mid-Point Circle Algorithm Exercise
Use the mid-point circle algorithm to draw
the circle centred at (0,0) with radius 15
40
of
Mid-Point Circle Algorithm Example
50 (cont)
16
k pk (xk+1,yk+1) 2xk+1 2yk+1
15
14
0
13
12 1
11 2
10 3
9 4
8
5
7
6 6
5 7
4 8
3
9
2
1 10
0 11
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 12
41
of
50
Mid-Point Circle Algorithm Summary
The key insights in the mid-point circle
algorithm are:
Eight-way symmetry can hugely reduce the
work in drawing a circle
Moving in unit steps along the x axis at each
point along the circles edge we need to
choose between two possible y coordinates
42
of
50
Filling Polygons
So we can figure out how to draw lines and
circles
How do we go about drawing polygons?
We use an incremental algorithm known as
the scan-line algorithm
43
of
50
Scan-Line Polygon Fill Algorithm
10 Scan Line
0
2 4 6 8 10 12 14 16
44
of
50
Scan-Line Polygon Fill Algorithm
The basic scan-line algorithm is as follows:
Find the intersections of the scan line with all
edges of the polygon
Sort the intersections by increasing x
coordinate
Fill in all pixels between pairs of intersections
that lie interior to the polygon
45
of
Scan-Line Polygon Fill Algorithm
50 (cont)
46
of
50
Line Drawing Summary
Over the last couple of lectures we have
looked at the idea of scan converting lines
The key thing to remember is this has to be
FAST
For lines we have either DDA or Bresenham
For circles the mid-point algorithm
47
of
50
Blank Grid
48
of
50
Blank Grid
49
of
50
Blank Grid
10
9
8
7
6
5
4
3
2
1
0
0 1 2 3 4 5 6 7 8 9 10
50
of
50
Blank Grid