Traversing a set of points with a minimum number of turns (Q5901749): Difference between revisions

@@ Property / cites work @@
+Minimum-link watchman tours
@@ Property / cites work: Minimum-link watchman tours / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Covering Tours with Turn Costs
@@ Property / cites work: Optimal Covering Tours with Turn Costs / rank @@
+Normal rank
@@ Property / cites work @@
+Research Problems in Discrete Geometry
@@ Property / cites work: Research Problems in Discrete Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+COVERING A SET OF POINTS WITH A MINIMUM NUMBER OF TURNS
+Normal rank
@@ Property / cites work @@
+Improved lower bounds for the link length of rectilinear spanning paths in grids
+Normal rank
@@ Property / cites work @@
+Angle-restricted tours in the plane.
@@ Property / cites work: Angle-restricted tours in the plane. / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for hitting objects with straight lines
+Normal rank
@@ Property / cites work @@
+Q4326201
@@ Property / cites work: Q4326201 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945513
@@ Property / cites work: Q4945513 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of locating linear facilities in the plane
+Normal rank
@@ Property / cites work @@
+Q4537759
@@ Property / cites work: Q4537759 / rank @@
+Normal rank