Pages that link to "Item:Q5057427"

The following pages link to Computing a shortest watchman path in a simple polygon in polynomial-time (Q5057427):

Displaying 10 items.

• Complexity of minimum corridor guarding problems (Q456091) (← links)
• Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
• Performance bounds for planning in unknown terrain (Q814477) (← links)
• Watchman routes in the presence of a pair of convex polygons (Q1291565) (← links)
• Fast computation of shortest watchman routes in simple polygons (Q1607078) (← links)
• Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
• Shortest watchman tours in simple polygons under rotated monotone visibility (Q2019474) (← links)
• Computing a Hamiltonian path of minimum Euclidean length inside a simple polygon (Q2392920) (← links)
• Watchman routes for lines and line segments (Q2445196) (← links)
• Moving an angle around a region (Q5054844) (← links)