Question

In Bresenham’s line algorithm, if the distances d1 < d2 then decision parameter Pk is ?

Answer is negative.
Please explain why Ans in negative...

Answer 1

Answer:

the power of his eyes was considerably enchanced by their position (Make future perfect Tense)

Answer 2

Answer:

If the distances d1 < d2, the decision parameter Pk in Bresenham's line procedure is negative.

Explanation:

• Bresenham's line algorithm is a line drawing method that calculates which points in an n-dimensional raster should be chosen to make a close approximation of a straight line between two locations. It's a method of reducing errors incrementally.
• It is one of the first algorithms in the field of computer graphics to be created. For drawing circles, an extension to the original method can be utilised.

Decision parameter is a set of criteria that is used to make subsequent computations. For example, in the Bresenham algorithm, if the decision factor is greater than zero, one set of activities is performed, and if the decision factor is less than zero, another set of actions is performed.

                                 d1 − d2= 2m(xk + 1) − 2yk + 2b − 1

• Hence from the above formulae, we can say that , If d1 < d2 then the decision variable is always negative.

#SPJ3