Frame-Buffer
November 29, 2023Question 5933 – UGC NET CS 2009-June-Paper-2
November 29, 2023Question 6847 – Computer-Graphics
The Liang-Barsky line clipping algorithm uses the parametric equation of a line from (x1, y1) to (x2, y2) along with its infinite extension which is given as :
x = x1 + ∆x.u
y = y1 + ∆y.u
Where ∆x = x2– x1, ∆y = y2– y1, and u is the parameter with 0 ≤ u ≤ 1. A line AB with endpoints A(–1, 7) and B(11, 1) is to be clipped against a rectangular window with xmin = 1, xmax = 9, ymin = 2, and ymax = 8.
The lower and upper bound values of the parameter u for the clipped line using Liang-Barsky algorithm is given as :
Correct Answer: B
(0, 2/3)
(1/6 , 5/6)
(0, 1/3)
(0, 1)
Subscribe
Login
0 Comments