<s>
Moving	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
is	O
a	O
method	O
of	O
reconstructing	O
continuous	O
functions	O
from	O
a	O
set	O
of	O
unorganized	O
point	O
samples	O
via	O
the	O
calculation	O
of	O
a	O
weighted	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
measure	O
biased	O
towards	O
the	O
region	O
around	O
the	O
point	O
at	O
which	O
the	O
reconstructed	O
value	O
is	O
requested	O
.	O
</s>
<s>
In	O
computer	O
graphics	O
,	O
the	O
moving	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
method	O
is	O
useful	O
for	O
reconstructing	O
a	O
surface	O
from	O
a	O
set	O
of	O
points	O
.	O
</s>
<s>
Often	O
it	O
is	O
used	O
to	O
create	O
a	O
3D	O
surface	O
from	O
a	O
point	B-Algorithm
cloud	I-Algorithm
through	O
either	O
downsampling	B-Algorithm
or	O
upsampling	B-Algorithm
.	O
</s>
<s>
In	O
numerical	O
analysis	O
to	O
handle	O
contributions	O
of	O
geometry	O
where	O
it	O
is	O
difficult	O
to	O
obtain	O
discretizations	O
,	O
the	O
moving	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
methods	O
have	O
also	O
been	O
used	O
and	O
generalized	O
to	O
solve	O
PDEs	O
on	O
curved	O
surfaces	O
and	O
other	O
geometries	O
.	O
</s>
<s>
In	O
machine	O
learning	O
,	O
moving	B-Algorithm
least	I-Algorithm
squares	I-Algorithm
methods	O
have	O
also	O
been	O
used	O
to	O
develop	O
model	O
classes	O
and	O
learning	O
methods	O
.	O
</s>
