UGC NET Computer Science December 2019 | Question 68

Question 68

---

Which of the following algorithms is not used for line clipping ?

1. 1. Cohen-Sutherland algorithm
2. 2. Southerland-Hodgeman algorithm
3. 3. Liang-Barsky algorithm
4. 4. Nicholl-Lee-Nicholl algorithm

Explanation

The Cohen–Sutherland algorithm is a computer-graphics algorithm used for line clipping. The algorithm divides a two-dimensional space into 9 regions and then efficiently determines the lines and portions of lines that are visible in the central region of interest (the view-port).

Sutherland–Hodgman Algorithm is to clip polygon edges. A convex polygon and a convex clipping area are given. Input is in the form of vertices of the polygon in clockwise order.

The Liang-Barsky algorithm is a line clipping algorithm. This algorithm is more efficient than Cohen–Sutherland line clipping algorithm and can be extended to 3-Dimensional clipping.

The Nicholl–Lee–Nicholl algorithm is a fast line clipping algorithm that reduces the chances of clipping a single line segment multiple times, as may happen in the Cohen–Sutherland algorithm.

So, option 2 is correct answer.

Previous	Next
UGC NET CS December 2019 - Question 67	UGC NET CS December 2019 - Question 69