Liang–Barsky algorithm: Difference between revisions

Revision as of 14:56, 27 April 2012

Revision as of 05:12, 25 May 2012

Line 1:

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 boxwindow to determine the intersections between the line and the clipping boxwindow. With these intersections it knows which portion of the line should be drawn. 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.