MCQOPTIONS
Bookmark
Saved Bookmarks
→
Computer Graphics
→
2D Reflection Shear
→
The Liang-Barsky algorithm is more efficient than ..
1.
The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm.
A.
True
B.
False
Answer» B. False
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?
How many inequalities are solved in this algorithm?
When pk < 0, then the line is ___________
When the line is parallel to the boundaries then what is the value of pk?
Liang–Barsky algorithm is a __________ clipping algorithm.
HOW_MANY_INEQUALITIES_ARE_SOLVED_IN_THIS_ALGORITHM??$
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?$
When pk < 0, then the line is __________?
Which type of arithmetic is used in Liang Barsky algorithm?
When the line is parallel to the boundaries then what is the value of p<sub>k</sub>?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply