<s>
Jump-and-Walk	O
is	O
an	O
algorithm	O
for	O
point	B-Data_Structure
location	I-Data_Structure
in	O
triangulations	B-Algorithm
(	O
though	O
most	O
of	O
the	O
theoretical	O
analysis	O
were	O
performed	O
in	O
2D	O
and	O
3D	O
random	O
Delaunay	B-Algorithm
triangulations	I-Algorithm
)	O
.	O
</s>
<s>
Surprisingly	O
,	O
the	O
algorithm	O
does	O
not	O
need	O
any	O
preprocessing	O
or	O
complex	O
data	O
structures	O
except	O
some	O
simple	O
representation	O
of	O
the	O
triangulation	B-Algorithm
itself	O
.	O
</s>
<s>
The	O
algorithm	O
was	O
a	O
folklore	O
in	O
practice	O
for	O
some	O
time	O
,	O
and	O
the	O
formal	O
presentation	O
of	O
the	O
algorithm	O
and	O
the	O
analysis	O
of	O
its	O
performance	O
on	O
2D	O
random	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
was	O
done	O
by	O
Devroye	O
,	O
Mucke	O
and	O
Zhu	O
in	O
mid-1990s	O
(	O
the	O
paper	O
appeared	O
in	O
Algorithmica	O
,	O
1998	O
)	O
.	O
</s>
<s>
The	O
analysis	O
on	O
3D	O
random	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
was	O
done	O
by	O
Mucke	O
,	O
Saias	O
and	O
Zhu	O
(	O
ACM	O
Symposium	O
of	O
Computational	O
Geometry	O
,	O
1996	O
)	O
.	O
</s>
<s>
In	O
both	O
cases	O
,	O
a	O
boundary	O
condition	O
was	O
assumed	O
,	O
namely	O
,	O
Q	O
must	O
be	O
slightly	O
away	O
from	O
the	O
boundary	O
of	O
the	O
convex	O
domain	O
where	O
the	O
vertices	O
of	O
the	O
random	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
are	O
drawn	O
.	O
</s>
