Pages that link to "Item:Q4289632"
From MaRDI portal
The following pages link to AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES (Q4289632):
Displaying 4 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Complexity of minimum corridor guarding problems (Q456091) (← links)
- Polygon exploration with time-discrete vision (Q1037781) (← links)
- An improved algorithm for computing a shortest watchman route for lines (Q1685027) (← links)
