<s>
In	O
computer	O
graphics	O
,	O
the	O
Cyrus	B-Algorithm
–	I-Algorithm
Beck	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
generalized	O
algorithm	O
for	O
line	B-Algorithm
clipping	I-Algorithm
.	O
</s>
<s>
It	O
was	O
designed	O
to	O
be	O
more	O
efficient	O
than	O
the	O
Cohen	B-Algorithm
–	I-Algorithm
Sutherland	I-Algorithm
algorithm	I-Algorithm
,	O
which	O
uses	O
repetitive	O
clipping	O
.	O
</s>
<s>
Cyrus	B-Algorithm
–	I-Algorithm
Beck	I-Algorithm
is	O
a	O
general	O
algorithm	O
and	O
can	O
be	O
used	O
with	O
a	O
convex	O
polygon	O
clipping	O
window	O
,	O
unlike	O
Cohen-Sutherland	B-Algorithm
,	O
which	O
can	O
be	O
used	O
only	O
on	O
a	O
rectangular	O
clipping	O
area	O
.	O
</s>
