Fast neighbor search by using revised k-d tree
From MaRDI portal
Publication:2200699
DOI10.1016/J.INS.2018.09.012zbMATH Open1441.68027OpenAlexW2889593075WikidataQ129288949 ScholiaQ129288949MaRDI QIDQ2200699FDOQ2200699
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
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
- An Algorithm for Finding Best Matches in Logarithmic Expected Time
- The quickhull algorithm for convex hulls
- Multidimensional binary search trees used for associative searching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nearest-neighbor searching under uncertainty. II
- New directions in nearest neighbor searching with applications to lattice sieving
- Model approach to grammatical evolution: deep-structured analyzing of model and representation
Cited In (11)
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Accelerating patch-based low-rank image restoration using kd-forest and Lanczos approximation
- Some approaches to improve tree-based nearest neighbour search algorithms
- Fast stepwise regression based on multidimensional indexes
- Title not available (Why is that?)
- Automata, Languages and Programming
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- Refinements to nearest-neighbor searching in k-dimensional trees
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Fast exact \(k\) nearest neighbors search using an orthogonal search tree
Uses Software
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)
