<s>
In	O
computer	O
graphics	O
,	O
the	O
Liang	B-Algorithm
–	I-Algorithm
Barsky	I-Algorithm
algorithm	I-Algorithm
(	O
named	O
after	O
You-Dong	O
Liang	O
and	O
Brian	O
A	O
.	O
Barsky	O
)	O
is	O
a	O
line	B-Algorithm
clipping	I-Algorithm
algorithm	O
.	O
</s>
<s>
The	O
Liang	B-Algorithm
–	I-Algorithm
Barsky	I-Algorithm
algorithm	I-Algorithm
uses	O
the	O
parametric	O
equation	O
of	O
a	O
line	O
and	O
inequalities	O
describing	O
the	O
range	O
of	O
the	O
clipping	O
window	O
to	O
determine	O
the	O
intersections	O
between	O
the	O
line	O
and	O
the	O
clip	O
window	O
.	O
</s>
<s>
So	O
this	O
algorithm	O
is	O
significantly	O
more	O
efficient	O
than	O
Cohen	B-Algorithm
–	I-Algorithm
Sutherland	I-Algorithm
.	O
</s>
<s>
The	O
idea	O
of	O
the	O
Liang	B-Algorithm
–	I-Algorithm
Barsky	I-Algorithm
clipping	O
algorithm	O
is	O
to	O
do	O
as	O
much	O
testing	O
as	O
possible	O
before	O
computing	O
line	O
intersections	O
.	O
</s>
