SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS (Q3521595): Difference between revisions

@@ 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 @@
+Multidimensional binary search trees used for associative searching
+Normal rank
@@ Property / cites work @@
+Approximate closest-point queries in high dimensions
+Normal rank
@@ Property / cites work @@
+Squarish <i>k</i>-<i>d</i> Trees
@@ Property / cites work: Squarish <i>k</i>-<i>d</i> Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
+Normal rank
@@ Property / cites work @@
+Dynamic data structures for fat objects and their applications
+Normal rank
@@ Property / cites work @@
+On the union of fat wedges and separating a collection of segments by a line
+Normal rank
@@ Property / cites work @@
+A deterministic skip list for \(k\)-dimensional range search
+Normal rank
@@ Property / cites work @@
+Foundations of multidimensional and metric data structures.
+Normal rank