Shortest watchman routes in simple polygons

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Robert E. Tarjan, Christopher J. Van Wyk · SIAM Journal on Computing · 1988 · 158 citations

Engineering, Computational Complexity, Geometry Generation +16

Optimum watchman routes

Wei-Pang Chin, Simeon Ntafos · Information Processing Letters · 1988 · 155 citations

Mathematical Programming, Route Choice, Optimum Watchman Routes +6

Linear time algorithms for visibility and shortest path problems inside simple polygons

Leonidas Guibas, John Hershberger, Daniel Leven et al. · 1986 · 113 citations

Optimum watchman routes

Wei-Pang Chin, Simeon Ntafos · 1986 · 101 citations

Mathematical Programming, Engineering, Network Routing +19

Minimum link paths in polygons and related problems

Subhash Suri · 1987 · 57 citations

Mathematical Programming, Engineering, Geometry +20