Line Circle Algorithm
Line Circle Algorithm
15 k dk (x ,y)
14
13
0
12
1
11
2
10
.
9
.
6 7 8 9 10 11 12 13 14 15 16 17
So do it……..
Note:
• This method is well suited for the line having the
slope less than 45º.
• When the magnitude of the slope is lesser than 1, x
incremented by one, and the decision variable is
made use to find the incremental value of y.
• When the slope is greater than 1, y is incremented
by one and x is incremented based on decision
variable.
• Line is constructed from left to right. For the right
to left appropriate directions need to be reversed.
DDA line algorithm : Disadvantages
• Key disadvantage:
it relies on floating point operations to compute
pixel positions.
• Implications:
Computationally inefficient because floating-
point operations are slow.
Round-off errors accumulate, producing incorrect
line drawings (e.g., if m is rounded to 0.9 even
though it is equal to 0.99, lines of length > 10 will
be drawn inaccurately)
Circle algorithm
Starting with the equation of the circle