Touring a sequence of disjoint polygons: Complexity and extension

New lower bound techniques for robot motion planning problems

John Canny, John H. Reif · 1987 · 544 citations

Computing, Computer Science, Robotics Engineering +14

25th Annual Symposium on Foundations of Computer Science

IEEE Computer Graphics and Applications · 1986 · 435 citations

Computing, Computer Science, Algorithms +13

An Optimal Algorithm for Euclidean Shortest Paths in the Plane

John Hershberger, Subhash Suri · SIAM Journal on Computing · 1999 · 326 citations

Computing, Computer Science, Mathematics +13

Shortest watchman routes in simple polygons

Wei-Pang Chin, Simeon Ntafos · Discrete & Computational Geometry · 1991 · 136 citations · Full text

Computing, Computer Science, Transportation Planning +12

Touring a sequence of polygons

Moshe Dror, Alon Efrat, Anna Lubiw et al. · 2003 · 135 citations

Computing, Computer Science, Algorithms +13