On R-trees with low query complexity (Q1869749): Difference between revisions

@@ Property / author @@
-Mark T. de Berg
@@ Property / author: Mark T. de Berg / rank @@
-Normal rank
@@ Property / author @@
-Joachim Gudmundsson
@@ Property / author: Joachim Gudmundsson / rank @@
-Normal rank
@@ Property / author @@
-Mikael Hammar
@@ Property / author: Mikael Hammar / rank @@
-Normal rank
@@ Property / author @@
+Mark T. de Berg
@@ Property / author: Mark T. de Berg / rank @@
+Normal rank
@@ Property / author @@
+Joachim Gudmundsson
@@ Property / author: Joachim Gudmundsson / rank @@
+Normal rank
@@ Property / author @@
+Mikael Hammar
@@ Property / author: Mikael Hammar / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4796163
@@ Property / cites work: Q4796163 / rank @@
+Normal rank
@@ Property / cites work @@
+Enclosing many boxes by an optimal pair of boxes
@@ Property / cites work: Enclosing many boxes by an optimal pair of boxes / rank @@
+Normal rank
@@ Property / cites work @@
+Q4239932
@@ Property / cites work: Q4239932 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of a bounding box heuristic for object intersection
+Normal rank