<s>
Stencil	B-Algorithm
jumping	I-Algorithm
,	O
at	O
times	O
called	O
stencil	O
walking	O
,	O
is	O
an	O
algorithm	O
to	O
locate	O
the	O
grid	O
element	O
enclosing	O
a	O
given	O
point	O
for	O
any	O
structured	B-Algorithm
mesh	I-Algorithm
.	O
</s>
<s>
In	O
simple	O
words	O
,	O
given	O
a	O
point	O
and	O
a	O
structured	B-Algorithm
mesh	I-Algorithm
,	O
this	O
algorithm	O
will	O
help	O
locate	O
the	O
grid	O
element	O
that	O
will	O
enclose	O
the	O
given	O
point	O
.	O
</s>
<s>
Another	O
approach	O
would	O
be	O
to	O
use	O
a	O
binary	O
search	O
algorithm	O
which	O
would	O
yield	O
a	O
result	O
comparable	O
in	O
speed	O
to	O
the	O
stencil	B-Algorithm
jumping	I-Algorithm
algorithm	O
.	O
</s>
<s>
A	O
combination	O
of	O
both	O
the	O
binary	O
search	O
and	O
the	O
stencil	B-Algorithm
jumping	I-Algorithm
algorithm	O
will	O
yield	O
an	O
optimum	O
result	O
in	O
the	O
minimum	O
possible	O
time	O
.	O
</s>
