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
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
4
of
39
5
of
39
6
of
39
Deriving The Bresenham Line Algorithm
2y xk 2x yk c
9
of
Deriving The Bresenham Line Algorithm
39 (cont…)
So, a decision parameter pk for the kth step
along a line is given by:
pk x(d lower 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
10
of
Deriving The Bresenham Line Algorithm
39 (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 )
11
of
Deriving The Bresenham Line Algorithm
39 (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
12
of
39
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 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
13
of
39
The Bresenham Line Algorithm (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
16
of
39
Bresenham Exercise
Go through the steps of the Bresenham line
drawing algorithm for a line going from
(21,12) to (29,16)
17
of
39
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
18
of
39
Bresenham Line Algorithm Summary
y0 20 2 0 2 20
y1 20 2 12 20
y2 20 2 2 2 20
y19 20 2 19 2 6
y20 20 2 20 2 0
21
of
A Simple Circle Drawing Algorithm
39 (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
22
of
39
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)
or:
pk 1 pk 2( xk 1) ( y 2
k 1 y ) ( yk 1 yk ) 1
2
k
10 pk
k (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
33
of
39
Mid-Point Circle Algorithm Exercise
Use the mid-point circle algorithm to draw
the circle centred at (0,0) with radius 15
34
of
Mid-Point Circle Algorithm Example
39 (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
35
of
39
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 circle’s edge we need to
choose between two possible y coordinates
36
of
39
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
37
of
39
Scan-Line Polygon Fill Algorithm
10 Scan Line
0
2 4 6 8 10 12 14 16
38
of
39
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
39
of
Scan-Line Polygon Fill Algorithm
39 (cont…)
40
of
39
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
41
of
39
Anti-Aliasing
42
of
39
Summary Of Drawing Algorithms
43
of
39
Mid-Point Circle Algorithm (cont…)
1 2 3 4
44
of
39
Mid-Point Circle Algorithm (cont…)
M
5
1 2 3 4
45
of
39
Mid-Point Circle Algorithm (cont…)
6
M
5
1 2 3 4
46
of
39
Blank Grid
47
of
39
Blank Grid
48
of
39
Blank Grid
10
9
8
7
6
5
4
3
2
1
0
0 1 2 3 4 5 6 7 8 9 10
49
of
39
Blank Grid