An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537): Difference between revisions

@@ Property / cites work @@
+Parallel algorithms for evaluating sequences of set-manipulation operations
+Normal rank
@@ Property / cites work @@
+Computing the visibility graph of points within a polygon
+Normal rank
@@ Property / cites work @@
+Linear space data structures for two types of range search
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Making data structures persistent
@@ Property / cites work: Making data structures persistent / rank @@
+Normal rank
@@ Property / cites work @@
+Q2970453
@@ Property / cites work: Q2970453 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing visibility on terrains in external memory
+Normal rank
@@ Property / cites work @@
+TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS
@@ Property / cites work: TERRAIN VISIBILITY WITH MULTIPLE VIEWPOINTS / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank