An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane (Q5387800): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-77120-3_58
+Normal rank
@@ Property / OpenAlex ID @@
+W1534329287
@@ Property / OpenAlex ID: W1534329287 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values
+Normal rank
@@ Property / cites work @@
+Shortest path amidst disc obstacles is computable
@@ Property / cites work: Shortest path amidst disc obstacles is computable / rank @@
+Normal rank
@@ Property / cites work @@
+A sweepline algorithm for Euclidean Voronoi diagram of circles
+Normal rank
@@ Property / cites work @@
+Computational Science and Its Applications – ICCSA 2004
+Normal rank
@@ Property / cites work @@
+Q4945516
@@ Property / cites work: Q4945516 / rank @@
+Normal rank
@@ Property / cites work @@
+Planning the Shortest Safe Path Amidst Unpredictably Moving Obstacles
+Normal rank