Approximating Minimization Diagrams and Generalized Proximity Search
From MaRDI portal
Publication:5502175
DOI10.1137/140959067zbMath1337.68270arXiv1304.0393OpenAlexW2174417008MaRDI QIDQ5502175
Nirman Kumar, Sariel Har-Peled
Publication date: 18 August 2015
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.0393
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)
Related Items (5)
Batched Point Location in SINR Diagrams via Algebraic Tools ⋮ Robust proximity search for balls using sublinear space ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ Resolving SINR Queries in a Dynamic Setting ⋮ Approximating Minimization Diagrams and Generalized Proximity Search
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point location in arrangements of hyperplanes
- Managing and mining uncertain data
- Efficient partition trees
- New lower bounds for Hopcroft's problem
- Nearest-neighbor searching under uncertainty. I
- Ray Shooting and Parametric Search
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Space-time tradeoffs for approximate nearest neighbor searching
- A Randomized Algorithm for Closest-Point Queries
- Constructing Approximate Shortest Path Maps in Three Dimensions
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Nearest-Neighbor Searching Under Uncertainty II
- Optimal partition trees
- Approximating Minimization Diagrams and Generalized Proximity Search
- Algorithms in real algebraic geometry
This page was built for publication: Approximating Minimization Diagrams and Generalized Proximity Search
