Shortest paths in simple polygons with polygon-meet constraints (Q2390305): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2004.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2172235831
@@ Property / OpenAlex ID: W2172235831 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest watchman routes in simple polygons
@@ Property / cites work: Shortest watchman routes in simple polygons / rank @@
+Normal rank
@@ Property / cites work @@
+The zookeeper route problem
@@ Property / cites work: The zookeeper route problem / 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 @@
+Q2768270
@@ Property / cites work: Q2768270 / 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 Euclidean Shortest Paths in the Plane
+Normal rank
@@ Property / cites work @@
+Q3535949
@@ Property / cites work: Q3535949 / rank @@
+Normal rank
@@ Property / cites work @@
+Watchman routes under limited visibility
@@ Property / cites work: Watchman routes under limited visibility / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the watchman route and zookeeper's problems.
+Normal rank
@@ Property / cites work @@
+Finding shortest safari routes in simple polygons
@@ Property / cites work: Finding shortest safari routes in simple polygons / rank @@
+Normal rank