<s>
The	O
Visvalingam	B-Algorithm
–	I-Algorithm
Whyatt	I-Algorithm
algorithm	I-Algorithm
,	O
also	O
known	O
as	O
the	O
Visvalingam	O
's	O
algorithm	O
,	O
is	O
an	O
algorithm	O
that	O
decimates	B-Algorithm
a	O
curve	O
composed	O
of	O
line	O
segments	O
to	O
a	O
similar	O
curve	O
with	O
fewer	O
points	O
.	O
</s>
<s>
With	O
the	O
use	O
of	O
a	O
priority	B-Application
queue	I-Application
,	O
the	O
algorithm	O
is	O
performant	O
on	O
large	O
inputs	O
,	O
since	O
the	O
importance	O
of	O
each	O
point	O
can	O
be	O
computed	O
using	O
only	O
its	O
neighbors	O
,	O
and	O
removing	O
a	O
point	O
only	O
requires	O
recomputing	O
the	O
importance	O
of	O
two	O
other	O
points	O
.	O
</s>
