alorithm those use the outputs of the previous iteration, in the computation of outputs in the current iteration are called

Related MCQs

• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies outside the window. Then while processing through that window boundary we should
• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies outside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
• In Sutherland – Hodgman algorithm for polygon clipping , assume P (present point ) lies inside the window and S ( Previous point) lies inside the window. Then while processing through that window boundary we should
• In scan line algorithm, using Edge coherence property the next incremental x-intersection(xs+1) can be calculated as: ------------Note: Xs is the previous x-intersection.
• The edges crossed by current scan line in Scan line polygon fill algorithm are called as
• When the current scan line in Scan line polygon fill algorithm moves above the upper / below the lower endpoint, the edge
• what will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm
• What will be the intersection points for current scan line as shown in figure using scan line polygon filling algorithm.
• If one edge of the polygon has end coordinates (10,20) and (15,40) and current scan line is scanning at y=25. What will be the intersection point?