I
NSTANCE
:
Polygon
P
with
n
integer-coordinates vertices and two points
and
t
in
P
.
S
OLUTION
:
A
k
-link path between
and
t
, i.e., a sequence
of
points inside
P
with
such that
,
, and, for all
i
with
, the segment between
and
is inside
P
.
M
EASURE
:
The Euclidean length of the path, i.e.,
where
d
denotes the Euclidean distance.
of
points inside
P
with
such that
,
, and, for all
i
with
, the segment between
and
is inside
P
.
where
d
denotes the Euclidean distance.