Pages that link to "Item:Q1807612"
From MaRDI portal
The following pages link to Finding the shortest watchman route in a simple polygon (Q1807612):
Displaying 29 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Shortest watchman routes in simple polygons (Q751818) (← links)
- Minimum-link watchman tours (Q1007602) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Watchman routes in the presence of a pair of convex polygons (Q1291565) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← links)
- The traveling salesmanpProblem for lines in the plane (Q1603540) (← links)
- Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- Routing in a polygonal terrain with the shortest beacon watchtower (Q1699277) (← links)
- Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← 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)
- Watchman routes for lines and line segments (Q2445196) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Online search for a hyperplane in high-dimensional Euclidean space (Q2671802) (← links)
- Approximating a shortest watchman route (Q2711329) (← links)
- Gender-aware facility location in multi-gender world (Q3301019) (← links)
- THE TRAVELING SALESMAN PROBLEM FOR LINES AND RAYS IN THE PLANE (Q4903631) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Moving an angle around a region (Q5054844) (← links)
- Concerning the time bounds of existing shortest watchman route algorithms (Q5055936) (← links)
- Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427) (← links)
- On Romeo and Juliet Problems: Minimizing Distance-to-Sight. (Q5116469) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)
- Observation routes and external watchman routes (Q6633574) (← links)
