2 Line Circle Algorithms
2 Line Circle Algorithms
(1,1) (2, 1) (3, 1) (4, 1) (5, 1) (6, 1) (7, 1) (8, 1) (9, 1) (10, 1)
DDA Algorithm:
Example: xinc = dx / n ; 1
yinc = dy / n ; 0
Start Point (1,1)
End Point (10,6) Sr. X Y Pixel
1 1 1 (1, 1)
dx = 10 - 1 = 9 2 2 1 (2, 1)
dy = 6 - 1 = 5
3 3 1 (3, 1)
4 4 1 (4, 1)
Compare dx and dy dx > dy 5 5 1 (5, 1)
6 6 1 (6, 1)
Number of steps n = dx 7 7 1 (7, 1)
8 8 1 (8, 1)
xinc = dx / n; ( 9/9 = 1 )
Unit - 3 Page 1
6 6 1 (6, 1)
Number of steps n = dx 7 7 1 (7, 1)
8 8 1 (8, 1)
xinc = dx / n; ( 9/9 = 1 )
yinc = dy / n; (5 / 9 = 0.5556 ) 9 9 1 (9, 1)
10. 10 1 (10,1)
dx = 9 - 1 = 8 (8)
dy = 1 - 3 = -2 (2)
n = max(dx, dy) 8
xinc = dx / n ; 1
yinc = dy / n ; - 0.25
Sr. X Y Pixel
1 1 3 (1, 3)
2 2 2.75 (2, 3)
3 3 2.50 (3, 3)
4 4 2.25 (4, 2)
5 5 2 (5, 2)
6 6 1.75 (6, 2)
7 7 1.50 (7, 2)
8 8 1.25 (8, 1)
9 1 (9.1)
Unit - 3 Page 2
(1,1) -> (10,6)
dx = 10 - 1 = 9
dy = 6 - 1 = 5
xinc = dx / n ; 1 1
yinc = dy / n ; 0.556
1 + 0.556 = 1.556
Unit - 3 Page 3