On semialgebraic range reporting
From MaRDI portal
Publication:6145667
DOI10.1007/s00454-023-00574-1arXiv2203.07096OpenAlexW4387909492MaRDI QIDQ6145667
Publication date: 9 January 2024
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.07096
Cites Work
- Tight lower bounds for halfspace range searching
- On the Erdős distinct distances problem in the plane
- How hard is half-space range searching?
- Range searching with efficient hierarchical cuttings
- Simplex range reporting on a pointer machine
- Multilevel polynomial partitions and simplified range searching
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
- On the importance of idempotence
- Lower Bounds on the Complexity of Polytope Range Searching
- Lower bounds for orthogonal range searching: I. The reporting case
- Lower bounds for orthogonal range searching: part II. The arithmetic model
- Simplex Range Searching and Its Variants: A Review
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- A New Lower Bound for Semigroup Orthogonal Range Searching
- On Range Searching with Semialgebraic Sets. II
