Refinements to nearest-neighbor searching in k-dimensional trees

DOI10.1007/BF01759061zbMATH Open0726.68023OpenAlexW2090398718MaRDI QIDQ802864FDOQ802864

Authors: Robert F. Sproull 

Publication date: 1991

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01759061

Recommendations

• scientific article; zbMATH DE number 5670169
• Some approaches to improve tree-based nearest neighbour search algorithms
• The efficiency of using k-d trees for finding nearest neighbors in discrete space
• Fast neighbor search by using revised \(k\)-d tree
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Randomized partition trees for nearest neighbor search
• New directions in approximate nearest-neighbor searching

zbMATH Keywords

k-dimensional treesnearest-neighbor searching

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Searching and sorting (68P10)

Cites Work

• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Multidimensional binary search trees used for associative searching

Cited In (28)

• An optimal-transport finite-particle method for mass diffusion
• Graph-theoretic algorithms for Kolmogorov operators: approximating solutions and their gradients in elliptic and parabolic problems on manifolds
• Resilient \(k\)-d trees: \(k\)-means in space revisited
• Chromatic nearest neighbor searching: A query sensitive approach
• Index structures for fast similarity search for real vectors. II
• Rank selection in multidimensional data
• Some approaches to improve tree-based nearest neighbour search algorithms
• Generalised kernel weighted fuzzy c-means clustering algorithm with local information
• Accounting for boundary effects in nearest-neighbor searching
• Familiarity based unified visual attention model for fast and robust object recognition
• Title not available (Why is that?)
• Expected time analysis for Delaunay point location
• Random projection-based auxiliary information can improve tree-based nearest neighbor search
• Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
• Title not available (Why is that?)
• Learning good prototypes for classification using filtering and abstraction of instances
• Neighbours on a grid
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Group nearest-neighbor queries in the \(L_1\) plane
• A counter example to a monotonicity property of k-d trees
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Efficient data structures for model-free data-driven computational mechanics
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
• Squarish \(k\)-\(d\) trees
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Robust registration of surfaces using a refined iterative closest point algorithm with a trust region approach
• The efficiency of using k-d trees for finding nearest neighbors in discrete space
• Reliable updates of the transformation in the iterative closest point algorithm

This page was built for publication: Refinements to nearest-neighbor searching in k-dimensional trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802864)