Which polygon clipping algorithm executed by clipping all polygon edges against the viewing screen edges one viewing screen edge at a time?

Related MCQs

• 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
• 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?
• 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 14. What will be the x-value of the intersection point of the scan line in i+1 th step?
• In Sutherland – Hodgman algorithm for polygon clipping, clipping along boundaries sequence is used as
• Generalised clipping algorithm deals with clipping against _____ line.
• Generalised clipping algorithm deals with clipping against _____ line.
• The seed fill algorithm for filling polygon is classified as ________ fill algorithm and _______ fill algorithm.
• 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.