Optimal partition trees
From MaRDI portal
Publication:5405856
DOI10.1145/1810959.1810961zbMath1284.68588OpenAlexW2028801888MaRDI QIDQ5405856
Publication date: 3 April 2014
Published in: Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1810959.1810961
Symbolic computation and algebraic computation (68W30) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items (7)
Semi-algebraic Ramsey numbers ⋮ Tight lower bounds for halfspace range searching ⋮ Approximate Polytope Membership Queries ⋮ Fast Fréchet queries ⋮ Unnamed Item ⋮ Approximating Minimization Diagrams and Generalized Proximity Search ⋮ Unnamed Item
This page was built for publication: Optimal partition trees
