Obstacle growing in a nonpolygonal world (Q1107992): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(87)90091-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2056156249
@@ Property / OpenAlex ID: W2056156249 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5581251
@@ Property / cites work: Q5581251 / rank @@
+Normal rank
@@ Property / cites work @@
+Spatial Planning: A Configuration Space Approach
@@ Property / cites work: Spatial Planning: A Configuration Space Approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q4195958
@@ Property / cites work: Q4195958 / rank @@
+Normal rank
@@ Property / cites work @@
+Plane-sweep algorithms for intersecting geometric figures
+Normal rank
@@ Property / cites work @@
+Q3856120
@@ Property / cites work: Q3856120 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680652
@@ Property / cites work: Q3680652 / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
+Normal rank
@@ Property / cites work @@
+An O(n2) shortest path algorithm for a non-rotating convex body
+Normal rank