Which of the following algorithms is not used for line clipping?
2019
Which of the following algorithms is not used for line clipping?
- A.
Cohen-Sutherland algorithm
- B.
Southerland-Hodgeman algorithm
- C.
Liang-Barsky algorithm
- D.
Nicholl-Lee-Nicholl algorithm
Attempted by 70 students.
Show answer & explanation
Correct answer: B
Correct answer: The Southerland-Hodgeman entry refers to the Sutherland–Hodgman algorithm, which is not used for line clipping.
Brief explanation:
Sutherland–Hodgman: A polygon-clipping algorithm that clips polygon vertices against each clip boundary. It operates on polygons, not individual lines, so it is the algorithm not used for line clipping.
Cohen–Sutherland: A line-clipping algorithm that uses region codes (outcodes) for trivial accept/reject and subdivision of lines against a rectangular clip window.
Liang–Barsky: A line-clipping algorithm based on the parametric form of a line; it computes intersection parameters efficiently using inequalities.
Nicholl–Lee–Nicholl: A line-clipping algorithm that minimizes intersection tests by classifying line positions relative to the clip window.
Note: The option text contains a misspelling. The correct name is Sutherland–Hodgman; clarify this for accuracy when presenting the correct answer.