Which of the following algorithms is not used for line clipping?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: B. Southerland-Hodgeman algorithm
Explanation
Sutherland–Hodgman clips polygons; Cohen–Sutherland, Liang–Barsky and Nicholl–Lee–Nicholl are line-clipping algorithms.
More Programming Languages and Computer Graphics questions
- 1024 × 768 If we want to resize a pixels image to one that is 640 pixels wide with the same aspect ratio, what would be the height of the r…
- Java Virtual Machine (JVM) is used to execute architectural neutral byte code. Which of the following is needed by the JVM for execution of…
- Consider the following statements with respect to approaches to fill areas on raster systems : P: To determine the overlap intervals for sc…
- Which of the following statements are true regarding C ++ ? (a) Overloading gives the capability to an existing operator to operate on othe…
- Which of the following are legal C statements? (a) int *P = &44; (b) int *P = &r; (c) int P = &a; (d) int P = a;
- On a 32-bit x86 machine: typedef struct { union { unsigned char a; unsigned short b; } U; unsigned char c; } S; S B[10]; S *p = &B[4]; S *q…