Fast neighbor search by using revised \(k\)-d tree

DOI10.1016/J.INS.2018.09.012zbMath1441.68027OpenAlexW2889593075WikidataQ129288949 ScholiaQ129288949MaRDI QIDQ2200699

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

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)

Related Items (2)

Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation ⋮ Fast stepwise regression based on multidimensional indexes

Uses Software

• Matlab
• Qhull
• OpenCL
• FLANN

Cites Work

• Unnamed Item
• Unnamed Item
• Model approach to grammatical evolution: deep-structured analyzing of model and representation
• Multidimensional binary search trees used for associative searching
• An Algorithm for Finding Best Matches in Logarithmic Expected Time
• The quickhull algorithm for convex hulls
• New directions in nearest neighbor searching with applications to lattice sieving
• Nearest-Neighbor Searching Under Uncertainty II

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