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

- Cohen-Sutherland algorithm
- Sutherland-Hodgeman algorithm
- Liang-Barsky algorithm
- Nicholl-Lee-Nicholl algorithm

## 1 Answer

B) Sutherland-Hodgeman algorithm ..

**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.**