Highly Influential

In this paper, we consider the problem of touring a sequence of line segments in presence of polygonal domain fences. In this problem there is a sequence S = (s = S0, . . . , Sk, Sk+1 = t) in which s and t are respectively start and target points and S1, . . . , Sk are line segments in the plane. Also, we are given a sequence F = (F0, . . . , Fk) of planar… (More)