Approximate range searching in external memory (Q627532): Difference between revisions

@@ Property / cites work @@
+Efficient searching with linear constraints
@@ Property / cites work: Efficient searching with linear constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535014
@@ Property / cites work: Q4535014 / rank @@
+Normal rank
@@ Property / cites work @@
+Box-trees and R-trees with near-optimal query time
+Normal rank
@@ Property / cites work @@
+Q4552048
@@ Property / cites work: Q4552048 / rank @@
+Normal rank
@@ Property / cites work @@
+The priority R-tree
@@ Property / cites work: The priority R-tree / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate range searching
@@ Property / cites work: Approximate range searching / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal algorithm for approximate nearest neighbor searching fixed dimensions
+Normal rank
@@ Property / cites work @@
+Approximate closest-point queries in high dimensions
+Normal rank
@@ Property / cites work @@
+Approximate range searching using binary space partitions
+Normal rank
@@ Property / cites work @@
+Sharp quantum versus classical query complexity separations
+Normal rank
@@ Property / cites work @@
+Guarding scenes against invasive hypercubes.
@@ Property / cites work: Guarding scenes against invasive hypercubes. / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
+Normal rank
@@ Property / cites work @@
+Box-trees for collision checking in industrial installations
+Normal rank
@@ Property / cites work @@
+R-trees: theory and applications
@@ Property / cites work: R-trees: theory and applications / rank @@
+Normal rank
@@ Property / cites work @@
+The design of dynamic data structures
@@ Property / cites work: The design of dynamic data structures / rank @@
+Normal rank