A linear-time 2-approximation algorithm for the watchman route problem for simple polygons (Q2382287): Difference between revisions

@@ Property / cites work @@
+Finding an approximate minimum-link visibility path inside a simple polygon
+Normal rank
@@ Property / cites work @@
+Characterizing LR-visibility polygons and related problems
+Normal rank
@@ Property / cites work @@
+Finding the shortest watchman route in a simple polygon
+Normal rank
@@ Property / cites work @@
+Visibility and intersection problems in plane geometry
+Normal rank
@@ Property / cites work @@
+Optimum watchman routes
@@ Property / cites work: Optimum watchman routes / rank @@
+Normal rank
@@ Property / cites work @@
+LR-visibility in polygons
@@ Property / cites work: LR-visibility in polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Touring a sequence of polygons
@@ Property / cites work: Touring a sequence of polygons / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM
@@ Property / cites work: AN OPTIMAL ALGORITHM FOR THE TWO-GUARD PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Fast computation of shortest watchman routes in simple polygons
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the watchman route and zookeeper's problems.
+Normal rank
@@ Property / cites work @@
+AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
+Normal rank
@@ Property / cites work @@
+CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
+Normal rank