# Computer Graphics Questions & Answers – Nicholl-Lee-Nicholl Line Clipping

This set of Computer Graphics MCQs focuses on “Nicholl-Lee-Nicholl Line Clipping”.

1. Cohen Sutherland clipping algorithm computes _______ number of intersections than NLN line clipping.
a) more
b) less
c) same
d) can’t be predicted

Explanation: One of the problems common to both the Cohen-Sutherland and the Liang-Barsky algorithm is that more intersections are computed than necessary.

2. Liang-Barsky clipping algorithm computes _______ number of intersections than NLN line clipping.
a) more
b) less
c) same
d) can’t be predicted

Explanation: One of the problems common to both the Cohen-Sutherland and the Liang-Barsky algorithm is that more intersections are computed than necessary.

3. What is full form of NLN line clipping algorithm?
a) Nicholl-Liang-Nicholl algorithm
b) Nicholai-Liang-Nicholl algorithm
c) Nicholai-Lee-Nicholl algorithm
d) Nicholl-Lee-Nicholl algorithm

Explanation: The full form of NLN clipping algorithm is Nicholl-Lee-Nicholl algorithm. It is a fast method of clipping.

4. A polygon can be clipped by using the Nicholl-Lee-Nicholl algorithm.
a) True
b) False

Explanation: The Nicholl–Lee–Nicholl algorithm is a fast line clipping algorithm that reduces the chances of clipping a single line segment multiple times.

5. The area around the clipping window is divided into a number of different ______________
a) pixels
b) squares
c) areas
d) lines

Explanation: The area around the clipping window is divided into a number of different areas, depending on the position of the initial point of the line to be clipped.
Note: Join free Sanfoundry classes at Telegram or Youtube

6. In how many areas the initial point should be present?
a) 3
b) 5
c) 2
d) 8

Explanation: The initial point should be in three predetermined areas; so that the line may have to be translated or rotated to bring it into the desired region.

7. These areas are given names depending on the location of ___________________
a) endpoints
b) initial points
c) intermediate points
d) intersection points

Explanation: These areas are then designated as L, LT, LB, or TR, depending on the location of the initial point.

8. What is the denotation of a ray if it intersects the top boundary?
a) L
b) T
c) P
d) B

Explanation: T – ray intersects top boundary; LT – ray intersects left and top boundary.

9. What is the denotation of a ray if it intersects the top and right boundary?
a) RT
b) TR
c) LR
d) LT

Explanation: R – ray intersects right boundary; TR – ray intersects top and right boundary.

10. The division of area is affected by the position of endpoints.
a) True
b) False

Explanation: The regions are determined by the property that, no matter where in the region the second point (endpoint) is, the segment will have to be intersected with the same boundaries of the window.

Sanfoundry Global Education & Learning Series – Computer Graphics.

To practice MCQs on all areas of Computer Graphics, here is complete set of 1000+ Multiple Choice Questions and Answers.

If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]