<s>
In	O
computer	O
graphics	O
,	O
the	O
Nicholl	B-Algorithm
–	I-Algorithm
Lee	I-Algorithm
–	I-Algorithm
Nicholl	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
fast	O
algorithm	O
for	O
line	B-Algorithm
clipping	I-Algorithm
that	O
reduces	O
the	O
chances	O
of	O
clipping	O
a	O
single	O
line	O
segment	O
multiple	O
times	O
,	O
as	O
may	O
happen	O
in	O
the	O
Cohen	B-Algorithm
–	I-Algorithm
Sutherland	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
Using	O
the	O
Nicholl	B-Algorithm
–	I-Algorithm
Lee	I-Algorithm
–	I-Algorithm
Nicholl	I-Algorithm
algorithm	I-Algorithm
,	O
the	O
area	O
around	O
the	O
clipping	O
window	O
is	O
divided	O
into	O
a	O
number	O
of	O
different	O
areas	O
,	O
depending	O
on	O
the	O
position	O
of	O
the	O
initial	O
point	O
of	O
the	O
line	O
to	O
be	O
clipped	O
.	O
</s>
