Liang-Barsky Algorithm

In computer graphics, the Liang-Barsky algorithm, named after You-Dong Liang and Brian A. Barsky, is a line clipping algorithm first published in early 1984. It uses the parametric equation of a line together with inequalities describing the range of the clipping window to determine the intersections between the line and the clip window, so it knows which portion of the line should be drawn, making it significantly more efficient than the Cohen-Sutherland algorithm. The idea of the Liang-Barsky clipping algorithm is to do as much testing as possible before computing the actual line intersections.