On Romeo and Juliet problems: minimizing distance-to-sight (Q2331220): Difference between revisions

@@ Property / cites work @@
+Finding the shortest watchman route in a simple polygon
+Normal rank
@@ Property / cites work @@
+Approximating Watchman Routes
@@ Property / cites work: Approximating Watchman Routes / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum watchman routes
@@ Property / cites work: Optimum watchman routes / rank @@
+Normal rank
@@ Property / cites work @@
+Watchman tours for polygons with holes
@@ Property / cites work: Watchman tours for polygons with holes / 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 @@
+Shortest path to a segment and quickest visibility queries
+Normal rank
@@ Property / cites work @@
+Q4580139
@@ Property / cites work: Q4580139 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
+Normal rank
@@ Property / cites work @@
+Optimal shortest path queries in a simple polygon
@@ Property / cites work: Optimal shortest path queries in a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+A new data structure for shortest path queries in a simple polygon
+Normal rank
@@ Property / cites work @@
+A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk
+Normal rank