1. The process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next.
a) True
b) False
Explanation: The process is repeated iteratively for each clip polygon side, using the output list from one stage as the input list for the next. When the process is completed, a new polygon is generated.
2. We can correctly clip a polygon by processing the polygon boundary as a whole against each ___________
a) side wall
b) top edge
c) window edge
d) bottom edge
Explanation: We can correctly clip a polygon by processing the polygon boundary as a whole against each window edge which can be accomplished by processing all polygon vertices against each rectangle.
3. How many edges of the clipping are/is present in 2D?
a) 1
b) 2
c) 3
d) 4
Explanation: If the algorithm is done in 2D, we have 4 edges of the clipping area. Left edge, right edge, top edge and bottom edge.
4. If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the ___________ edge.
a) left edge
b)right edge
c) top edge
d) bottom edge
Explanation: If we used Left->Right->Up->Bottom, the final output will be the vertex list outputted by the bottom edge. The final result is given by the last edge which is a bottom edge in this case.
5. If the subject polygon is concave at vertices outside the clipping polygon, the new polygon may have coincident edges.
a) True
b) False
Explanation: If the subject polygon was concave at vertices outside the clipping polygon, the new polygon may have coincident edges. The result will be the same in case of overlapping edges too.
6. In a convex polygon, each of the interior angles is less than ____degrees.
a) 90
b) 180
c) 360
d) 45
Explanation: A convex polygon is a simple polygon in which no line segment between two points on the boundary ever goes outside the polygon and interior angles are less than 180 degrees.
7. One of the drawbacks of Sutherland- Hodgeman algorithm is that it can’t produce ____________ areas.
a) connected
b) multiple
c) discrete
d) circular
Explanation: The Sutherland-Hodgeman algorithm is not able to produce connected areas. For connected areas, Weiler-Atherton Algorithm is used.
8. How many types of basic polygons are present?
a) 4
b) 2
c) 10
d) 5
Explanation: There are two types of basic polygons present. They are concave polygons and convex polygons. In a concave polygon at least one angle should be greater than 180. In a convex polygon all the angles should be less than 180.
9. A polygon can be a figure whose all edges are not connected with another edge.
a) True
b) False
Explanation: In a polygon, all lines are connected. Lines can be a combination of edges and vertices, which together form a polygon. It is a 2-dimensional shape made by connecting multiple straight lines.
10. Which of the following part of a polygon is considered in a polygon clipping algorithm?
a) Part which is both inside and outside the window
b) Part which is outside the window
c) Part which is inside the window
d) Part which is neither inside nor outside the window
Explanation: Polygon clipping is a process in which we only consider the part which is inside the view pane or window. We will remove or clip the part that is outside the window.