Fast computation of shortest watchman routes in simple polygons (Q1607078): Difference between revisions

@@ Property / author @@
+Xue-Hou Tan
@@ Property / author: Xue-Hou Tan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finding an approximate minimum-link visibility path inside a simple polygon
+Normal rank
@@ Property / cites work @@
+Finding the shortest watchman route in a simple polygon
+Normal rank
@@ Property / cites work @@
+Optimum watchman routes
@@ Property / cites work: Optimum watchman routes / 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 @@
+Q3138983
@@ Property / cites work: Q3138983 / rank @@
+Normal rank
@@ Property / cites work @@
+Concerning the time bounds of existing shortest watchman route algorithms
+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
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(00)00146-0
+Normal rank
@@ Property / OpenAlex ID @@
+W1974433908
@@ Property / OpenAlex ID: W1974433908 / rank @@
+Normal rank