Analysis of range search for random k-d trees

被引：3

作者：

Philippe Chanzy

Luc Devroye

Carlos Zamora-Cura

机构：

[1] School of Computer Science,

[2] McGill University,undefined

[3] Montreal,undefined

[4] Canada H3A 2K6 (e-mail: {luc,undefined

[5] czamora}@cs.mcgill.ca),undefined

来源：

Acta Informatica | 2001年 / 37卷

关键词：

Time Complexity; Time Analysis; Probabilistic Method; Random Point; Neighbor Search;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We analyze the expected time complexity of range searching with k-d trees in all dimensions when the data points are uniformly distributed in the unit hypercube. The partial match results of Flajolet and Puech are reproved using elementary probabilistic methods. In addition, we give asymptotic expected time analysis for orthogonal and convex range search, as well as nearest neighbor search. We disprove a conjecture by Bentley that nearest neighbor search for a given random point in the k-d tree can be done in O(1) expected time.

引用

页码：355 / 383

页数：28

共 50 条

[41] SEARCH FOR I=2 HYPERONS AND STUDY OF RESONANCES IN K-D INTERACTIONS
BARBAROGALTIERI, A
MATISON, MJ
RITTENBERG, A
CHADWICK, GB
GUIRAGOSSIAN, ZG
PICKUP, E
PHYSICAL REVIEW LETTERS, 1968, 21 (08) : 573 - +
[42] Fast Search Algorithm of Nonlinear LUT based on K-D Tree
Wu, Mou
Xie, Kai
Zeng, Guangquan
2013 INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND APPLICATIONS (CSA), 2013, : 281 - 284
[43] A Density Peaks Clustering Algorithm With Sparse Search and K-d Tree
Shan, Yunxiao
Li, Shu
Li, Fuxiang
Cui, Yuxin
Li, Shuai
Zhou, Ming
Li, Xiang
IEEE ACCESS, 2022, 10 : 74883 - 74901
[44] OPTIMAL CHOICE OF DISCRIMINATORS IN A BALANCED K-D BINARY SEARCH TREE
FILHO, YVS
INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 67 - 70
[45] THE EFFICIENCY OF USING K-D TREES FOR FINDING NEAREST NEIGHBORS IN DISCRETE SPACE
MURPHY, OJ
SELKOW, SM
INFORMATION PROCESSING LETTERS, 1986, 23 (04) : 215 - 218
[46] Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs
Gieseke, Fabian
Heinermann, Justin
Oancea, Cosmin
Igel, Christian
INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 1), 2014, 32
[47] An externalization of the k-d tree
Adam, M.
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY, 2007, 10 (04): : 323 - 333
[48] Fast Nearest Neighbor Search using Approximate Cached k-d Tree
Choi, Won-Seok
Oh, Se-Young
2012 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2012, : 4524 - 4529
[49] Modeling droplet-laden flows in moisture separators using k-d trees
Zhang, Huang
Liu, Qianfeng
Qin, Benke
Bo, Hanliang
ANNALS OF NUCLEAR ENERGY, 2015, 75 : 452 - 461
[50] An efficient implementation of distance-based diversity measures based on k-d trees
Agrafiotis, DK
Lobanov, VS
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1999, 39 (01): : 51 - 58

← 1 2 3 4 5 →