Region filling and clipping

**1.**

Liang–Barsky algorithm is a __________ clipping algorithm.

**2.**

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

**3.**

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

**4.**

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

**5.**

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

**6.**

When the line is parallel to the boundaries then what is the value of p_{k}?

**7.**

Which type of arithmetic is used in Liang Barsky algorithm?

**8.**

When pk < 0, then the line is ___________

**9.**

How many inequalities are solved in this algorithm?

**10.**

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