<s>
The	O
Greedy	B-Algorithm
Triangulation	I-Algorithm
is	O
a	O
method	O
to	O
compute	O
a	O
polygon	B-Algorithm
triangulation	I-Algorithm
or	O
a	O
Point	B-Algorithm
set	I-Algorithm
triangulation	I-Algorithm
using	O
a	O
greedy	B-Algorithm
schema	I-Algorithm
,	O
which	O
adds	O
edges	O
one	O
by	O
one	O
to	O
the	O
solution	O
in	O
strict	O
increasing	O
order	O
by	O
length	O
,	O
with	O
the	O
condition	O
that	O
an	O
edge	O
cannot	O
cut	O
a	O
previously	O
inserted	O
edge	O
.	O
</s>
