Question

8. In Bresenham's circle generation algorithm, if(x,y) is the current pixel position then the
y value of the next pixel position is
a) Y or y+1
b) y alone
c) y+1 or y-1
d) y or y-1​

Answer 1

Answer:

your answer is given above

Explanation:

make me as brainlist

Answer 2

Answer: Option d, y or y-1 is correct.

Concept:

Bresenham's Circle Drawing Algorithm is a circle drawing algorithm that completes the arc by selecting the nearest pixel point.

Find:

If (x,y) is the current pixel position then what will be the y value of the next pixel position?

Solution:

Bresenham's circle generation algorithm employs integer arithmetic, it is considerably faster than other algorithms in typical processors that use floating-point arithmetic.

The point (x, y) is on the circle and is in the first octant.

It is possible to compute the next pixel location in one of two ways:

$N(x+1, y)\\S(x+1, y-1)$

It is determined by the decision parameter d, which is as follows:

If $d < = 0$, then the next pixel will be: $N(x+1, y)$.

If $d > 0$, then the next pixel will be: $S(x+1, y-1)$.

Hence y value of the next pixel position is either y or y-1.

∴ Option d is correct.

All possible pixels (x,y) in 8 octants: