<s>
In	O
computational	O
geometry	O
,	O
the	O
Bowyer	B-Algorithm
–	I-Algorithm
Watson	I-Algorithm
algorithm	I-Algorithm
is	O
a	O
method	O
for	O
computing	O
the	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
of	O
a	O
finite	O
set	O
of	O
points	O
in	O
any	O
number	O
of	O
dimensions	O
.	O
</s>
<s>
The	O
algorithm	O
can	O
be	O
also	O
used	O
to	O
obtain	O
a	O
Voronoi	B-Architecture
diagram	I-Architecture
of	O
the	O
points	O
,	O
which	O
is	O
the	O
dual	O
graph	O
of	O
the	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
.	O
</s>
<s>
The	O
Bowyer	B-Algorithm
–	I-Algorithm
Watson	I-Algorithm
algorithm	I-Algorithm
is	O
an	O
incremental	O
algorithm	O
.	O
</s>
<s>
It	O
works	O
by	O
adding	O
points	O
,	O
one	O
at	O
a	O
time	O
,	O
to	O
a	O
valid	O
Delaunay	B-Algorithm
triangulation	I-Algorithm
of	O
a	O
subset	O
of	O
the	O
desired	O
points	O
.	O
</s>
<s>
The	O
following	O
pseudocode	B-Language
describes	O
a	O
basic	O
implementation	O
of	O
the	B-Algorithm
Bowyer-Watson	I-Algorithm
algorithm	I-Algorithm
.	O
</s>
<s>
And	O
if	O
the	O
points	O
are	O
uniformly	O
distributed	O
,	O
sorting	O
them	O
along	O
a	O
space	O
filling	O
Hilbert	B-Algorithm
curve	I-Algorithm
prior	O
to	O
insertion	O
can	O
also	O
speed	O
point	O
location	O
.	O
</s>
