Robust proximity search for balls using sublinear space
From MaRDI portal
Publication:1702130
DOI10.1007/s00453-016-0254-4zbMath1386.68199arXiv1401.1472OpenAlexW2558803383MaRDI QIDQ1702130
Nirman Kumar, Sariel Har-Peled
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.1472
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate range searching
- Geographic quorum system approximations
- Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions
- Down the Rabbit Hole: Robust Proximity Search and Density Estimation in Sublinear Space
- Robust Proximity Search for Balls Using Sublinear Space
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Space-time tradeoffs for approximate nearest neighbor searching
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Approximating Minimization Diagrams and Generalized Proximity Search