[Solved] 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

Q.	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
A.	store interaction point of line ps (s’) only
B.	store point p and s’
C.	store point p only
D.	store nothing
Answer» D. store nothing

1.5k

Do you find this helpful?

View all MCQs in

Computer Graphics

Discussion

No comments yet

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 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 Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is used as
In winding number method , constructed horizontal line between point Q and point P intersects two edges of the polygon with winding no. +1 and -1. Tell whether point Q is inside or outside and what is the net winding ? Note : Q is the point to be tested for inside test.P is point outside the polygon.
In winding number method , constructed horizontal line between point Q and point P intersects edge of the polygon with winding no. +1 . Tell whether point Q is inside or outside and what is the net winding ? Note : Q is the point to be tested for inside test. P is point outside the polygon.
Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?
A convex polygon is a polygon such that for any two points inside the polygon, all points on the line segment connecting them are __________the Polygon
A ______ polygon is a polygon such that for any two points inside the polygon, all points on the line segment connecting them are also inside the Polygon
A convex polygon is a polygon such that for any two points ____ the polygon, all points on the line segment connecting them are also ____ the Polygon