On the Cost of Fixed Partial Match Queries in K-d Trees
- 11 December 2015
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 75 (4) , 684-723
Abstract
No abstract availableKeywords
Funding Information
- Spanish Ministry of Economy and Competitiveness (MINECO) and European Union (FEDER funds) (TIN2013-46181-C2-1-R)
- Catalan Agency for the Management of University and Research Grants (AGAUR) (SGR 2014:1034 (ALBCOM))
This publication has 14 references indexed in Scilit:
- A limit process for partial match queries in random quadtrees and $2$-d treesThe Annals of Applied Probability, 2013
- Selection by rank in K‐dimensional binary search treesRandom Structures & Algorithms, 2012
- Partial match queries in two-dimensional quadtrees: a probabilistic approachAdvances in Applied Probability, 2011
- Partial Match Queries in Random k-d TreesSIAM Journal on Computing, 2006
- On the average performance of orthogonal range search in multidimensional data structuresJournal of Algorithms, 2002
- Analysis of range search for random k-d treesActa Informatica, 2001
- Squarish k-d TreesSIAM Journal on Computing, 2000
- Analysis of kdt-trees: Kd-trees improved by local reorganisationsLecture Notes in Computer Science, 1989
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975
- Quad trees a data structure for retrieval on composite keysActa Informatica, 1974