Pages that link to "Item:Q2988854"
From MaRDI portal
The following pages link to Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854):
Displaying 8 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
- Polynomial-time algorithms for the touring rays and related problems (Q2039639) (← links)
- The touring rays and related problems (Q2662682) (← links)
- Improved exploration of unknown polygons (Q2672604) (← links)
- Touring a sequence of polygons (Q3581275) (← links)
- Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)