A New Method to Construct the KD Tree Based on Presorted Results

Searching is one of the most fundamental operations in many complex systems. However, the complexity of the search process would increase dramatically in high-dimensional space. K-dimensional (KD) tree, as a classical data structure, has been widely used in high-dimensional vital data search. Howeve...

Full description

Saved in:
Bibliographic Details
Published inComplexity (New York, N.Y.) Vol. 2020; no. 2020; pp. 1 - 7
Main Authors Duan, Boheng, Zhao, Wenjing, Wang, Huizan, Cao, Yu, Zhang, Xiaojiang
Format Journal Article
LanguageEnglish
Published Cairo, Egypt Hindawi Publishing Corporation 2020
Hindawi
John Wiley & Sons, Inc
Wiley
Subjects
Online AccessGet full text

Cover

Loading…