Liang–Barsky algorithm: Difference between revisions

Revision as of 03:29, 19 February 2023

Revision as of 01:57, 1 May 2023

Line 2:

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.

ConsiderThe firstalgorithm theuses usualthe parametric form of a straight line:

:<math>x = x_0 + t (x_1 - x_0) = x_0 + t \Delta x,</math>