The following pages link to Touring a sequence of polygons (Q3581275):
Displaying 35 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Watchman tours for polygons with holes (Q419503) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Largest and smallest convex hulls for imprecise points (Q848964) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- Touring convex polygons in polygonal domain fences (Q1708597) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
- Shortest paths and convex hulls in 2D complexes with non-positive curvature (Q2206723) (← links)
- On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220) (← links)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Connectivity graphs of uncertainty regions (Q2408099) (← links)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- The touring rays and related problems (Q2662682) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Touring Disjoint Polygons Problem Is NP-Hard (Q2867133) (← links)
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
- Inspecting a Set of Strips Optimally (Q3183473) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- (Q5208219) (← links)
- Solving the Watchman Route Problem with Heuristic Search (Q5870496) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901277) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- Shortest Paths in Graphs of Convex Sets (Q6188512) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
