MCQOPTIONS
Bookmark
Saved Bookmarks
→
Computer Graphics Questions & Answers Liang-Barsky Line Clipping
→
General
→
What is the relative speed improvement over Cohen-...
1.
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?
A.
40%
B.
50%
C.
70%
D.
36%
Answer» E.
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 ___________
Liang Barsky algorithm is a __________ clipping algorithm.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies