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

Q.	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.
A.	outside , zero
B.	inside , zero
C.	outside , nonzero
D.	inside , nonzero
Answer» A. outside , zero

3.3k

Do you find this helpful?

View all MCQs in

Computer Graphics

Discussion

No comments yet

Related MCQs

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.
In an inside test if intersections point is a vertex and edges meeting at that vertex lies on ------------- side of constructed horizontal line then the number of intersections are considered as even number . Note : intersection point is a vertex
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
In an inside test if intersections point is a vertex and edges meeting at that vertex lies on same side of constructed horizontal line then the number of intersections are considered as ----------. Note : intersection point is a vertex
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 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
In winding number method if net winding is --------then point is outside otherwise it is inside.
In an inside test if number of intersections are ---------------- then point is inside of the polygon. Note : intersection point is not a vertex.
Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?
One edge of the polygon has coordinates (10,20) and (15,40). In scan line polygon filling at the ith step x-value of the intersection point of the scan line ‘i’ and above mentioned edge is 12. What will be the x-value of the intersection point of the scan line in i+1 th step?