Which of the following is not for line clipping?
Which of the following is not for line clipping?
Answer: D. Sutherland-Hodgeman Algorithm — Answer: Sutherland-Hodgman algorithm — used for polygon clipping, not line clipping. Why the other algorithms are for line clipping: Cohen-Sutherland: uses…
- A.
Cohen- Sutherland algorithm
- B.
Nicholl-Lee-Nicholl algorithm
- C.
Liang Barsky Algorithm
- D.
Sutherland-Hodgeman Algorithm
Attempted by 202 students.
Show answer & explanation
Correct answer: D
Answer: Sutherland-Hodgman algorithm — used for polygon clipping, not line clipping.
Why the other algorithms are for line clipping:
Cohen-Sutherland: uses region codes and bitwise operations to trivially accept, reject, or compute intersections for line segments against a rectangular window.
Liang-Barsky: uses the parametric form of a line and inequality tests to efficiently compute intersection parameters (entering and leaving) for clipping.
Nicholl-Lee-Nicholl: reorganizes and transforms cases to reduce intersection calculations, providing a fast line clipping method.
How Sutherland-Hodgman differs:
Processes polygon vertices/edges sequentially against each clipping boundary and constructs a new clipped polygon as output.
Designed for clipping filled polygons (areas), so it is not intended for isolating clipped line segments.
Conclusion: Sutherland-Hodgman is used for polygon clipping; the other listed algorithms (Cohen-Sutherland, Liang-Barsky, Nicholl-Lee-Nicholl) are line clipping algorithms.