Computer Graphics Liang Barsky Line Clipping Online Exam Quiz
Computer Graphics Liang Barsky Line Clipping GK Quiz. Question and Answers related to Computer Graphics Liang Barsky Line Clipping. MCQ (Multiple Choice Questions with answers about Computer Graphics Liang Barsky Line Clipping
How many inequalities are solved in this algorithm?
Options
A : 3
B : 2
C : 1
D : 4
What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?
Options
A : 40%
B : 50%
C : 70%
D : 36%
Liang–Barsky algorithm is a __________ clipping algorithm.
Options
A : circle
B : text
C : line
D : pixel
The ideas of the Liang-Barsky algorithm are the same with which algorithm?
Options
A : Cyrus Beck algorithm
B : Liam-Chopsky algorithm
C : Cohen Sutherland algorithm
D : All have the same
This algorithm uses the ____________ equations for a line and solves four inequalities.
Options
A : linear
B : quadratic
C : cubic
D : parametric
When pk < 0, then the line is ___________
Options
A : parallel to the boundaries
B : exceeding the boundaries
C : bounded inside the boundaries
D : can’t say
When the line is parallel to the boundaries then what is the value of pk?
Options
A : pk < 0
B : pk > 0
C : pk = 0
D : pk = 1
Which type of arithmetic is used in Liang Barsky algorithm?
Options
A : simple arithmetic operations
B : floating point arithmetic
C : fixed point arithmetic
D : logarithmic operations
Liang Barsky algorithm can be used to clip 3-D lines.
Options
A : True
B : False
C :
D :
The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm.
Options
A : True
B : False
C :
D :
Computer Graphics 2d Reflection Shear more Online Exam Quiz
Computer Graphics Clipping Operations
Computer Graphics Entrance Exams
Computer Graphics Interview Freshers
Computer Graphics Two Dimensional Viewing