<s>
The	O
Watchman	B-Algorithm
Problem	I-Algorithm
is	O
an	O
optimization	O
problem	O
in	O
computational	O
geometry	O
where	O
the	O
objective	O
is	O
to	O
compute	O
the	O
shortest	O
route	O
a	O
watchman	O
should	O
take	O
to	O
guard	O
an	O
entire	O
area	O
with	O
obstacles	O
given	O
only	O
a	O
map	O
of	O
the	O
area	O
.	O
</s>
