Solution

The correct answer is A - II, B - III, C - IV, D - I

EXPLANATION:

• A. Bresenham algorithm -
  • It's a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points. It was developed to avoid floating point operations which were costly in machine cycles on the computers of the time.
• B. Cohen-Sutherland algorithm
  • It is a computer-graphics algorithm used for line clipping, that is, given a line in the plane specified by its endpoints and a rectangle (also specified by its endpoint), the algorithm efficiently finds the points where the line intersects the rectangle - that's why it's categorized under 'Line clipping algorithm'.
• C. Sutherland-Hodgeman algorithm -
  • This algorithm is used in computer graphics for clipping polygons. It works by extending each segment of the polygon to the edges of the clipping rectangle.
• D. Z-Buffer algorithm -
  • It's a depth sorting algorithm in 3D computer graphics, used for hidden surface removal. It basically works by testing pixel depth for each polygon. If a polygon's depth is greater (meaning it's behind others), it's not drawn.