Liang–Barsky algorithm explained

In computer graphics, the Liang–Barsky algorithm (named after You-Dong Liang and Brian A. Barsky) is a line clipping algorithm. The Liang–Barsky algorithm uses the parametric equation of a line and inequalities describing the range of the clipping window to determine the intersections between the line and the clip window. With these intersections it knows which portion of the line should be drawn. So this algorithm is significantly more efficient than Cohen–Sutherland. The idea of the Liang–Barsky clipping algorithm is to do as much testing as possible before computing line intersections.

The algorithm uses the parametric form of a straight line:

x = x _{0} + t (x _{1} - x _{0)} = x _{0} + t \Delta x, y = y _{0} + t (y _{1} - y _{0)} = y _{0} + t \Delta y.

A point is in the clip window, if

x _{min} \le x _{0} + t \Delta x \le x _{max} andy _{min} \le y _{0} + t \Delta y \le y _{max,} which can be expressed as the 4 inequalitiest p _{i} \le q _{i,} i = 1 , 2 , 3 , 4 , where\begin{align} p _{1} & = - \Delta x, & q _{1} & = x _{0} - x _{min,} & & (left) \\ p _{2} & = \Delta x, & q _{2} & = x _{max} - x _{0,} & & (right) \\ p _{3} & = - \Delta y, & q _{3} & = y _{0} - y _{min,} & & (bottom) \\ p _{4} & = \Delta y, & q _{4} & = y _{max} - y _{0.} & & (top) \end{align}

To compute the final line segment:

1. A line parallel to a clipping window edge has

p _{i} = 0 for that boundary.

1. If for that

i , q _{i} < 0 , then the line is completely outside and can be eliminated.

1. When

p _{i} < 0 , the line proceeds outside to inside the clip window, and when p _{i} > 0 , the line proceeds inside to outside.

1. For nonzero

p _{i} , u = q _{i} / p _{i} gives t for the intersection point of the line and the window edge (possibly projected).

1. The two actual intersections of the line with the window edges, if they exist, are described by

u _{1} and u _{2} , calculated as follows. For u _{1} , look at boundaries for which p _{i} < 0 (i.e. outside to inside). Take u _{1} to be the largest among \{ 0 , q _{i} / p _{i\}} . For u _{2} , look at boundaries for which p _{i} > 0 (i.e. inside to outside). Take u _{2} to be the minimum of \{ 1 , q _{i} / p _{i\}} .

1. If

u _{1} > u _{2} , the line is entirely outside the clip window. If u _{1} < 0 < 1 < u _{2} it is entirely inside it.

// Liang—Barsky line-clipping algorithm

1. include
2. include
3. include

using namespace std;

// this function gives the maximumfloat maxi(float arr[],int n)

// this function gives the minimumfloat mini(float arr[], int n)

void liang_barsky_clipper(float xmin, float ymin, float xmax, float ymax, float x1, float y1, float x2, float y2)

int main

See also

Algorithms used for the same purpose:

• Cyrus–Beck algorithm
• Nicholl–Lee–Nicholl algorithm
• Fast clipping

References

• Liang, Y. D., and Barsky, B., "A New Concept and Method for Line Clipping", ACM Transactions on Graphics, 3(1):1–22, January 1984.
• Liang, Y. D., B. A., Barsky, and M. Slater, Some Improvements to a Parametric Line Clipping Algorithm, CSD-92-688, Computer Science Division, University of California, Berkeley, 1992.
• James D. Foley. Computer graphics: principles and practice. Addison-Wesley Professional, 1996. p. 117.

External links

• http://hinjang.com/articles/04.html#eight
• Skytopia: The Liang-Barsky line clipping algorithm in a nutshell!