The following pages link to (Q3138983):
Displayed 9 items.
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Watchman routes in the presence of a pair of convex polygons (Q1291565) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- The touring rays and related problems (Q2662682) (← links)
- Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments (Q3183469) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)