Refinements to nearest-neighbor searching in k-dimensional trees
From MaRDI portal
Publication:802864
DOI10.1007/BF01759061zbMath0726.68023OpenAlexW2090398718MaRDI QIDQ802864
Publication date: 1991
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01759061
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items (16)
Expected time analysis for Delaunay point location ⋮ Neighbours on a grid ⋮ Familiarity based unified visual attention model for fast and robust object recognition ⋮ Accounting for boundary effects in nearest-neighbor searching ⋮ An optimal-transport finite-particle method for mass diffusion ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Group nearest-neighbor queries in the \(L_1\) plane ⋮ Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach ⋮ Fast exact \(k\) nearest neighbors search using an orthogonal search tree ⋮ Index structures for fast similarity search for real vectors. II ⋮ Reliable updates of the transformation in the iterative closest point algorithm ⋮ Generalised kernel weighted fuzzy c-means clustering algorithm with local information ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search ⋮ Chromatic nearest neighbor searching: A query sensitive approach ⋮ Learning good prototypes for classification using filtering and abstraction of instances ⋮ Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
Cites Work
This page was built for publication: Refinements to nearest-neighbor searching in k-dimensional trees
