recategorized by
3,751 views
1 votes
1 votes

The Liang-Barsky line clipping algorithm uses the parametric equation of a line from $(x_{1} , y_{1} )$ to $(x_{2} , y_{2} )$ along with its infinite extension which is given as :

$x = x_{1} + \Delta x.u$

$y = y_{1} + \Delta y.u$ 

Where $\Delta x = x_{2} – x_{1} , \Delta y = y_{2} – y_{1}$, and $u$ is the parameter with $0 \leq u \leq 1$. A line $AB$ with end points $A(–1, 7)$ and $B(11, 1)$ is to be clipped against a rectangular window with $x_{min} = 1, x_{max} = 9, y_{min} = 2$, and $y_{max} = 8$. The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :

  1. $(0, \frac{2}{3})$
  2. $\left(\frac{1}{6},\frac{5}{6}\right)$
  3. $(0, \frac{1}{3})$
  4. $(0, 1)$
recategorized by

2 Answers

Related questions

1 votes
1 votes
1 answer
2
5 votes
5 votes
1 answer
3
makhdoom ghaya asked Sep 30, 2016
8,054 views
A point $P(2, 5)$ is rotated about a pivot point $(1, 2)$ by 60°. What is the new transformed point $P'$ ?$(1, 4)$$(–1, 4)$$(1, – 4)$$(– 4, 1)$
3 votes
3 votes
1 answer
4
makhdoom ghaya asked Sep 30, 2016
2,107 views
Consider a $N$-bit plane frame buffer with $W$-bit wide lookup table with $W N$. How many intensity levels are available at a time ?$2^{N}$$2^{W}$$2^{N+W}$$2^{N-1}$