A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835): Difference between revisions

@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for direct enclosures and direct dominances
+Normal rank
@@ Property / cites work @@
+On rectangular visibility
@@ Property / cites work: On rectangular visibility / rank @@
+Normal rank
@@ Property / cites work @@
+Hidden surface removal for rectangles
@@ Property / cites work: Hidden surface removal for rectangles / rank @@
+Normal rank
@@ Property / cites work @@
+Hole Problems for Rectangles in the Plane
@@ Property / cites work: Hole Problems for Rectangles in the Plane / rank @@
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel approximation algorithms for bin packing
@@ Property / cites work: Parallel approximation algorithms for bin packing / rank @@
+Normal rank