Pages that link to "Item:Q4289632"
From MaRDI portal
The following pages link to AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES (Q4289632):
Displayed 13 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- Approximation algorithms for the watchman route and zookeeper's problems. (Q1427191) (← 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)
- A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287) (← links)
- Online searching with an autonomous robot (Q2489019) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
- An Improved On-line Strategy for Exploring Unknown Polygons (Q3467843) (← links)
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES" (Q4949994) (← links)