Pages that link to "Item:Q2382287"

The following pages link to A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287):

Displaying 4 items.

• Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
• Complexity of minimum corridor guarding problems (Q456091) (← links)
• Watchman routes for lines and line segments (Q2445196) (← links)
• Improved exploration of unknown polygons (Q2672604) (← links)