Computer Graphics Questions & Answers – Line Clipping Using Non Rectangular Clip Windows

«
»

This set of Computer Graphics test focuses on “Line Clipping Using Non Rectangular Clip Windows”.

1. Which method of clipping is based on duality?
a) Skala
b) Sutherland clipping
c) Liam Barsky method
d) NLN clipping
View Answer

Answer: a
Explanation: Skala is a method of clipping whose algorithm is based on homogeneous coordinates and duality.
advertisement

2. Which method of clipping is used against convex polygon?
a) Lg N clipping algorithm
b) Skala
c) NLN clipping
d) Sutherland clipping
View Answer

Answer: b
Explanation: Skala can be used for a line or line-segment clipping against a rectangular window, as well as against a convex polygon.

3. Which algorithm classifies vertices against the given line?
a) P algorithm
b) NLN clipping algorithm
c) Skala
d) O algorithm
View Answer

Answer: d
Explanation: O algorithm classifies vertices against the given line in the implicit form p: ax + by + c = 0. Another name of O algorithm is Lg N algorithm.

4. O algorithm is also known as __________________
a) Lg N algorithm
b) Lg P algorithm
c) Lg M algorithm
d) Lg O algorithm
View Answer

Answer: a
Explanation: Another name of O algorithm is Lg N algorithm. This algorithm classifies vertices against the given line in the implicit form p: ax + by + c = 0.

5. Which type of search can be applied to O algorithm?
a) interpolation search
b) binary search
c) simple search
d) hexadecimal search
View Answer

Answer: b
Explanation: Binary search can be applied to O algorithm which leads to run-time complexity.
advertisement

6. O algorithm is simple and easy to implement.
a) True
b) False
View Answer

Answer: b
Explanation: Skala is simple and easy to implement whereas O algorithm shows run time complexity.

7. The polygon is assumed to be _____________ and vertices are ordered clockwise or anti-clockwise while applying line clipping algorithms.
a) cylindrical
b)concave
c) plane
d) convex
View Answer

Answer: d
Explanation: The polygon is assumed to be convex and vertices are ordered clockwise or anti-clockwise while applying line clipping algorithms. Anti-convex polygons are not used.

8. A plane duality is a map from a ______________________ to its dual plane.
a) projective plane
b) incident plane
c) parallel plane
d) reference plane
View Answer

Answer: a
Explanation: A plane duality is a map from a projective plane C = (P, L, I) to its dual plane C∗ = (L, P, I); which preserves incidence.

9. Fast clipping algorithm is an example of ____________ clipping algorithm.
a) text
b) polygon
c) line
d) curve
View Answer

Answer: c
Explanation: Line clipping is the process of removing lines or portions of lines outside an area of interest and fast clipping algorithm is an example of line clipping algorithm.
advertisement

10. Fast clipping algorithm has similarities with Liam Barsky algorithm.
a) True
b) False
View Answer

Answer: b
Explanation: Fast clipping algorithm has similarities with Cohen–Sutherland. The start and end positions are classified by which portion of the 9-area grid they occupy, in both of the algorithms.

Sanfoundry Global Education & Learning Series – Computer Graphics.

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

advertisement
advertisement
advertisement
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer & SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage, Advanced C Programming, SAN Storage Technologies, SCSI Internals & Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him @ LinkedIn