Time and space efficient collinearity indexing
From MaRDI portal
Publication:2678263
DOI10.1016/j.comgeo.2022.101963OpenAlexW4308581017MaRDI QIDQ2678263
Guy Zigdon, Esther Ezra, Boris Aronov, Micha Sharir
Publication date: 9 January 2023
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2022.101963
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)
Cites Work
- Improved subquadratic 3SUM
- Space-time trade-offs for some ranking and searching queries
- On a class of \(O(n^ 2)\) problems in computational geometry
- Subquadratic algorithms for some \textsc{3sum}-hard geometric problems in the algebraic decision-tree model
- Testing polynomials for vanishing on Cartesian products of planar point sets: collinearity testing and related problems
- Subquadratic algorithms for algebraic 3SUM
- Threesomes, Degenerates, and Love Triangles
- Simplex Range Searching and Its Variants: A Review
- Rigorous Time/Space Trade-offs for Inverting Functions
- More Logarithmic-factor Speedups for 3SUM, (median,+)-convolution, and Some Geometric 3SUM-hard Problems
- Improved Bounds for 3SUM, k-SUM, and Linear Degeneracy
- Data structures meet cryptography: 3SUM with preprocessing
- Near-optimal Linear Decision Trees for k-SUM and Related Problems
- Algorithms in real algebraic geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Time and space efficient collinearity indexing
