Match List I with List II
| List I | List II |
|---|---|
| (a) Bresenham | (I) Hidden surface removal |
| (b) Cohen-Sutherland algorithm | (II) Line drawing |
| (c) Sutherland-Hodgeman algorithm | (III) Line clipping |
| (d) Z-Buffer algorithm | (IV) Polygon clipping |
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. (a)-(II), (b)-(III), (c)-(IV), (d)-(I)
Explanation
Bresenham is line drawing (II), Cohen-Sutherland is line clipping (III), Sutherland-Hodgeman is polygon clipping (IV), and the Z-buffer does hidden-surface removal (I).More Programming Languages and Computer Graphics questions
- Consider the following code segment:int arr[] = {0,1,2,3,4}; int i = 1, *ptr; ptr = arr + 2; Arrange the following printf statements in inc…
- Statement (I): A friend function and the member functions of a friend class can directly access private and protected data. Statement (II):…
- Match List I with List IIList I List II A. Bezier curves I. 3-D objects that have translational/rotational symmetry B. B-Splines II. Fracta…
- What will be the output of the following code?#include <stdio.h> int main() { int a, b, c; a = 0x10; b = 010; c = a + b; printf("%d", c); r…
- A three-dimensional array in C++ is declared as int A[a][b][c]. Array elements are stored in row-major order and indexing begins from 0. Th…
- What is the output of the following code?main() { struct s1 { char *z; int i; struct s1 *p; }; static struct s1 a[] = { {"Nagpur", 1, a+1},…