<s>
The	O
Ramer	B-Algorithm
–	I-Algorithm
Douglas	I-Algorithm
–	I-Algorithm
Peucker	I-Algorithm
algorithm	I-Algorithm
,	O
also	O
known	O
as	O
the	O
Douglas	B-Algorithm
–	I-Algorithm
Peucker	I-Algorithm
algorithm	I-Algorithm
and	O
iterative	O
end-point	O
fit	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>
The	O
algorithm	O
is	O
widely	O
used	O
in	O
robotics	O
to	O
perform	O
simplification	O
and	O
denoising	O
of	O
range	O
data	O
acquired	O
by	O
a	O
rotating	O
range	O
scanner	O
;	O
in	O
this	O
field	O
it	O
is	O
known	O
as	O
the	O
split-and-merge	B-Algorithm
algorithm	I-Algorithm
and	O
is	O
attributed	O
to	O
Duda	O
and	O
Hart	O
.	O
</s>
<s>
In	O
the	O
best	O
case	O
or	O
at	O
each	O
recursive	O
invocation	O
in	O
which	O
case	O
the	O
running	O
time	O
has	O
the	O
well-known	O
solution	O
(	O
via	O
the	O
master	B-Algorithm
theorem	I-Algorithm
for	I-Algorithm
divide-and-conquer	I-Algorithm
recurrences	I-Algorithm
)	O
of	O
.	O
</s>
<s>
Using	O
(	O
fully	O
or	O
semi	O
-	O
)	O
dynamic	B-Algorithm
convex	I-Algorithm
hull	I-Algorithm
data	O
structures	O
,	O
the	O
simplification	O
performed	O
by	O
the	O
algorithm	O
can	O
be	O
accomplished	O
in	O
time	O
.	O
</s>
