recategorized by
3,005 views
1 votes
1 votes

Consider the Breshenham’s line generation algorithm for a line with gradient greater than one, current point $(x_{ i} , y_{i} )$ and decision parameter, $d_{i}$. The next point to be plotted $(x _{i+1}, y_{i+1})$ and updated decision parameter, $d_{i+1}$, for $d_{i} < 0$ are given as _______.

  1. $x_{ i+1} = x _{i +1} y_{i+1} = y_{i} d_{i+1} = d_{i} + 2 dy$
  2. $x _{i+1} = x _{i} y_{i+1} = y_{i + 1} d_{i+1} = d_{i} + 2 dx$
  3. $x _{i+1} = x_{ i}  y_{i+1} = y_{i + 1}  d_{i+1} = d_{i} + 2 (dx – dy)$
  4. $x_{ i+1} = x_{ i + 1}  y_{i+1} = y_{i + 1} d_{i+1} = d_{i} + 2 (dy – dx)$
recategorized by

1 Answer

0 votes
0 votes

Correct option is A.

When di < 0 we choose east pixel and for next points increment X and no change in Y then add east pixel value to old di for new di.

When di > 0 we choose north east pixel and increment both X and Y and add value of North pixel to di.

When di = 0 we can choose any one of them to find next points to be plotted.

Hence, di < 0  is satisfied by option A. 

Related questions

1 votes
1 votes
1 answer
2
5 votes
5 votes
1 answer
3
makhdoom ghaya asked Sep 30, 2016
8,057 views
A point $P(2, 5)$ is rotated about a pivot point $(1, 2)$ by 60°. What is the new transformed point $P'$ ?$(1, 4)$$(–1, 4)$$(1, – 4)$$(– 4, 1)$
3 votes
3 votes
1 answer
4
makhdoom ghaya asked Sep 30, 2016
2,108 views
Consider a $N$-bit plane frame buffer with $W$-bit wide lookup table with $W N$. How many intensity levels are available at a time ?$2^{N}$$2^{W}$$2^{N+W}$$2^{N-1}$