Computer Graphics Questions & Answers – Sutherland-Hodgeman Polygon Clipping

This set of Computer Graphics Questions and Answers for Entrance exams focuses on “Sutherland-Hodgeman Polygon Clipping”.

1. Sutherland-Hodgeman clipping is an example of_________________ algorithm.
a) line clipping
b) polygon clipping
c) text clipping
d) curve clipping

Explanation: The Sutherland–Hodgman algorithm is used for clipping polygons. Cohen- Sutherland is line clipping algorithm.

2. How many polygons are used in this method?
a) 4
b) 3
c) 2
d) 1

Explanation: Two polygons are used in this algorithm namely clip polygon and subject polygon.

3. Only vertices from the subject polygon that are on the _______________ are selected.
a) lower half
b) boundary
c) opaque side
d) visible side

Explanation: Only vertices from the subject polygon which are on the visible side are selected and rest of the vertices are clipped.

4. 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.

5. 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.
Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

6. 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.

7. 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.

8. 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.

9. 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.

10. 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.

Sanfoundry Global Education & Learning Series – Computer Graphics.

To practice all areas of Computer Graphics for Entrance exams, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]