Dynamic partition trees (Q5056121): Difference between revisions

@@ Property / cites work @@
+Decomposable searching problems
@@ Property / cites work: Decomposable searching problems / rank @@
+Normal rank
@@ Property / cites work @@
+Priority Search Trees
@@ Property / cites work: Priority Search Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3772828
@@ Property / cites work: Q3772828 / rank @@
+Normal rank
@@ Property / cites work @@
+Halfplanar range search in linear space and \(O(n^{0.695})\) query time
+Normal rank
@@ Property / cites work @@
+\(\epsilon\)-nets and simplex range queries
@@ Property / cites work: \(\epsilon\)-nets and simplex range queries / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning with two lines in the plane
@@ Property / cites work: Partitioning with two lines in the plane / rank @@
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank
@@ Property / cites work @@
+Storing line segments in partition trees
@@ Property / cites work: Storing line segments in partition trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992847
@@ Property / cites work: Q3992847 / rank @@
+Normal rank
@@ Property / cites work @@
+A simple output-sensitive algorithm for hidden surface removal
+Normal rank
@@ Property / cites work @@
+An improved technique for output-sensitive hidden surface removal
+Normal rank
@@ Property / cites work @@
+Polygon Retrieval
@@ Property / cites work: Polygon Retrieval / rank @@
+Normal rank