The clipping window is mapped into a

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
• A window with 6 clipping boundaries can be considered under___ clipping.
• In viewing transformation maintain relative size an position between clipping window and viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Xv=
• In viewing transformation maintain relative size an position between clipping window and viewport. ie a point in window Xw, Yw is transformed to Xv, Yv where Yv=
• The line is said to be interior to the clipping window if ___________point(s) is/ are interior to the window.
• Why the Cohen-Sutherland Line-Clipping Algorithm involves much more calculations than the other line clipping algorithms?
• If the x coordinate boundaries of the clipping rectangle are Xmin and Xmax, and the y coordinate boundaries are Ymin and Ymax, then ___________ must be satisfied for a point at (X,Y) to be inside the clipping rectangle