Fast neighbor search by using revised k-d tree

DOI10.1016/J.INS.2018.09.012MaRDI QIDQ2200699zbMATHOpenAlexWikidataFDO

Authors Lida Zhou, Yi Tang, Jai Puneet Singh, Nizar Bouguila, Cheng Wang, Huazhen Wang, Ye-Wang Chen, Ji-Xiang Du

Publication date 22 September 2020

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2018.09.012

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 5670169
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Refinements to nearest-neighbor searching in k-dimensional trees
• 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

Cites work

• scientific article; zbMATH DE number 437556 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• Model approach to grammatical evolution: deep-structured analyzing of model and representation
• Multidimensional binary search trees used for associative searching
• Nearest-neighbor searching under uncertainty. II
• New directions in nearest neighbor searching with applications to lattice sieving
• The quickhull algorithm for convex hulls

Cited in

(12)

• Fast stepwise regression based on multidimensional indexes
• Concurrent linearizable nearest neighbour search in LockFree-kD-tree
• Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
• scientific article; zbMATH DE number 5670169 (Why is no real title available?)
• An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
• Some approaches to improve tree-based nearest neighbour search algorithms
• Parallel nearest neighbors in low dimensions with batch updates
• Automata, Languages and Programming
• Fast exact \(k\) nearest neighbors search using an orthogonal search tree
• Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
• Refinements to nearest-neighbor searching in k-dimensional trees
• Fast and versatile algorithm for nearest neighbor search based on a lower bound tree

Describes a project that uses

Uses Software

• Matlab
• Qhull
• OpenCL
• FLANN

This page was built for publication: Fast neighbor search by using revised \(k\)-d tree

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