Abstract
Given a sequence of k convex polygons in the plane, a start point s, and a target point t, we seek a shortest path that starts at s, visits in order e......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
