Computer Graphics
Region filling and clipping
Q.

If both codes are 0000, (bitwise OR of the codes yields 0000) line lies __________________ the window.
A.  

completely outside

 B.  

half inside half outside

 C.  

completely inside

 D.  

can’t say anything
Similar Questions
1.

Liang–Barsky algorithm is a __________ clipping algorithm.
A.  

circle

 B.  

text

 C.  

line

 D.  

pixel
2.

The ideas of the Liang-Barsky algorithm are the same with which algorithm?
A.  

Cyrus Beck algorithm

 B.  

Liam-Chopsky algorithm

 C.  

Cohen Sutherland algorithm

 D.  

All have the same
3.

Liang Barsky algorithm can be used to clip 3-D lines.
A.  

True

 B.  

False
4.

This algorithm uses the ____________ equations for a line and solves four inequalities.
A.  

linear

 B.  

quadratic

 C.  

cubic

 D.  

parametric
5.

The Liang-Barsky algorithm is more efficient than the Cohen Sutherland algorithm.
A.  

True

 B.  

False
6.

When the line is parallel to the boundaries then what is the value of pk?
A.  

pk < 0

 B.  

pk > 0

 C.  

pk = 0

 D.  

pk = 1
7.

Which type of arithmetic is used in Liang Barsky algorithm?
A.  

simple arithmetic operations

 B.  

floating point arithmetic

 C.  

fixed point arithmetic

 D.  

logarithmic operations
8.

When pk < 0, then the line is ___________
A.  

parallel to the boundaries

 B.  

exceeding the boundaries

 C.  

bounded inside the boundaries

 D.  

can’t say
9.

How many inequalities are solved in this algorithm?
A.  

3

 B.  

2

 C.  

1

 D.  

4
10.

What is the relative speed improvement over Cohen-Sutherland algorithm for 2-D lines?
A.  

40%

 B.  

50%

 C.  

70%

 D.  

36%
COMPUTER GRAPHICS TOPICS