Pages that link to "Item:Q2988854"

The following pages link to Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854):

Displaying 5 items.

• 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)
• Approximation algorithms for the two-watchman route in a simple polygon (Q6614109) (← links)