Parallel algorithms for all minimum link paths and link center problems (Q5056133): Difference between revisions

@@ Property / cites work @@
+-Algorithms for Minimum Link Path and Related Problems
+Normal rank
@@ Property / cites work @@
+An O(n log n) algorithm for computing a link center in a simple polygon
+Normal rank
@@ Property / cites work @@
+Computing the visibility polygon from a convex set and related problems
+Normal rank
@@ Property / cites work @@
+Triangulating a polygon in parallel
@@ Property / cites work: Triangulating a polygon in parallel / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the link center of a simple polygon
@@ Property / cites work: Computing the link center of a simple polygon / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for minimum link paths inside a simple polygon
+Normal rank
@@ Property / cites work @@
+An Efficient Parallel Biconnectivity Algorithm
@@ Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank @@
+Normal rank