Algorithm of DDA
Write down the algorithm of DDA (Digital differential analyzer) scan conversion algorithm?
Expert
Algorithm:
Step 1: Input the line end-points and store the left end-point in (x1, y1) and right end-point in (x2, y2).
Step 2: Compute the values of Δx and Δy by using Δx = xb – xa, Δy = yb – ya
Step 3: When the values of Δx > Δy then assign values of steps as Δx or else the values of steps as Δy.
Step 4: Compute the values of X increment and Y increment and assign the value x= xa and y = ya.
Step 5: For k = 1 to steps do
X = X + X increment Y= Y + Y increment
Putpixel(ceil(x), ceil(y),15)
Step 6: End
Describe Cohen Sutherland Line Clippings Algorithm in brief?
Write a short note on JPEG (or Joint Photographic Experts Group)?
Briefly illustrate the term Data glove? Write down its key features.
Write a short note on the term vector scan Display?
Describe the features of Video controller?
Illustrate the term scaling?
Explain the term attribute parameter? Specify its several attributes of the line?
Describe what do you understand by the interactive computer Graphics?
Illustrate the principle of vanishing point?
Describe the term Cyrus Beck Line Clipping Algorithm.
18,76,764
1961327 Asked
3,689
Active Tutors
1447298
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!