Tight lower bounds for halfspace range searching (Q420572): Difference between revisions

@@ Property / DOI @@
-.1007/s00454-012-9412-x
@@ Property / DOI: 10.1007/s00454-012-9412-x / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00454-012-9412-x
+Normal rank
@@ Property / OpenAlex ID @@
+W4248139057
@@ Property / OpenAlex ID: W4248139057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4225298
@@ Property / cites work: Q4225298 / rank @@
+Normal rank
@@ Property / cites work @@
+On the importance of idempotence
@@ Property / cites work: On the importance of idempotence / rank @@
+Normal rank
@@ Property / cites work @@
+The effect of corners on the complexity of approximate range searching
+Normal rank
@@ Property / cites work @@
+How hard is half-space range searching?
@@ Property / cites work: How hard is half-space range searching? / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal partition trees
@@ Property / cites work: Optimal partition trees / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Complexity of Polytope Range Searching
+Normal rank
@@ Property / cites work @@
+Lower bounds for orthogonal range searching: part II. The  arithmetic model
+Normal rank
@@ Property / cites work @@
+Quasi-optimal upper bounds for simplex range searching and new zone theorems
+Normal rank
@@ Property / cites work @@
+Quasi-optimal range searching in spaces of finite VC-dimension
+Normal rank
@@ Property / cites work @@
+Approximate range searching: The absolute model
@@ Property / cites work: Approximate range searching: The absolute model / rank @@
+Normal rank
@@ Property / cites work @@
+Realistic input models for geometric algorithms
@@ Property / cites work: Realistic input models for geometric algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Halfplanar range search in linear space and \(O(n^{0.695})\) query time
+Normal rank
@@ Property / cites work @@
+Space-Time Tradeoffs for Emptiness Queries
@@ Property / cites work: Space-Time Tradeoffs for Emptiness Queries / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Complexity of Some Optimal Data Structures
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization.
+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 @@
+Range searching with efficient hierarchical cuttings
+Normal rank
@@ Property / cites work @@
+Polygon Retrieval
@@ Property / cites work: Polygon Retrieval / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Maintaining Partial Sums
@@ Property / cites work: On the Complexity of Maintaining Partial Sums / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00454-012-9412-X
@@ Property / DOI: 10.1007/S00454-012-9412-X / rank @@
+Normal rank