Nearest-neighbor interpolation


Question 1:

Suppose that you have an algorithm that can fill 3D triangles with a constant color. Describe what additional information and additions to the algorithm are needed to Gouraud shade the triangles.

Question 2:

Given the algorithm in (1), describe what additional information and additions to the algorithm are needed to texture map the triangles by using bilinear interpolation, comprising a description of how the bilinear interpolation is done.

Question 3:

Describe the merits and demerits of using nearest-neighbor interpolation compared with bilinear interpolation.

Question 4:

Describe why a MIPmap would be helpful for texture mapping and how one could be incorporated to the algorithm from (2).

Request for Solution File

Ask an Expert for Answer!!
Computer Graphics: Nearest-neighbor interpolation
Reference No:- TGS08954

Expected delivery within 24 Hours