The following pages link to Minimum-link watchman tours (Q1007602):
Displaying 17 items.
- Watchman tours for polygons with holes (Q419503) (← links)
- Improved parameterized algorithms for minimum link-length rectilinear spanning path problem (Q477189) (← links)
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- The complexity of drawing a graph in a polygonal region (Q1725774) (← links)
- Rainbow polygons for colored point sets in the plane (Q2032728) (← links)
- Taming the knight's tour: minimizing turns and crossings (Q2067620) (← links)
- Online exploration outside a convex obstacle (Q2166745) (← links)
- Covering paths for planar point sets (Q2250054) (← links)
- On the shortest separating cycle (Q2306364) (← links)
- Delineating boundaries for imprecise regions (Q2479529) (← links)
- Is It FPT to Cover Points with Tours on Minimum Number of Bends (Errata)? (Q2950590) (← links)
- FPT-ALGORITHMS FOR MINIMUM-BENDS TOURS (Q2999094) (← links)
- The Complexity of Drawing a Graph in a Polygonal Region (Q5050006) (← links)
- On Covering Points with Minimum Turns (Q5892218) (← links)
- Traversing a set of points with a minimum number of turns (Q5901749) (← links)
