Lower bounds for semialgebraic range searching and stabbing problems
From MaRDI portal
Lower bounds for semialgebraic range searching and stabbing problems (scientific article; zbMATH DE number 8191479)
Cites work
- A deterministic view of random sampling and its use in geometry
- An efficient algorithm for generalized polynomial partitioning and its applications
- Cutting hyperplane arrangements
- Cutting hyperplanes for divide-and-conquer
- Handbook of data structures and applications
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower Bounds on the Complexity of Polytope Range Searching
- Multilevel polynomial partitions and simplified range searching
- New applications of random sampling in computational geometry
- On range searching with semialgebraic sets
- On range searching with semialgebraic sets. II.
- On the complexity of range searching among curves
- On the Erdős distinct distances problem in the plane
- On the size of Kakeya sets in finite fields
- Optimal partition trees
- Polygon Retrieval
- Quasi-optimal range searching in spaces of finite VC-dimension
- Range searching with efficient hierarchical cuttings
- Simplex range reporting on a pointer machine
- Simplex Range Searching and Its Variants: A Review
This page was built for publication: Lower bounds for semialgebraic range searching and stabbing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7234064)
