The n-dimensional k-vector and its application to orthogonal range searching
作者：
Highlights：
• Generalization of the k-vector methodology.
• Algorithm devised to perform orthogonal range searching in static databases.
• Able to perform range searching in multidimensional spaces.
• Very adaptable to the memory available.
• Better speed performance than k-d tree methodologies or brute force approach.
摘要
•Generalization of the k-vector methodology.•Algorithm devised to perform orthogonal range searching in static databases.•Able to perform range searching in multidimensional spaces.•Very adaptable to the memory available.•Better speed performance than k-d tree methodologies or brute force approach.
论文关键词：Computer science,Computational geometry,Orthogonal range searching,Database structures,Multidimensional spaces,
论文评审过程：Received 22 May 2019, Revised 10 December 2019, Accepted 22 December 2019, Available online 8 January 2020, Version of Record 8 January 2020.
论文官网地址：https://doi.org/10.1016/j.amc.2019.125010
