Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
From MaRDI portal
Publication:906406
DOI10.1016/J.TCS.2015.12.030zbMath1333.68083OpenAlexW2463369284MaRDI QIDQ906406
Nikolett Bereczky, Salvador Roura, Krisztián Németh, Amalia Duch
Publication date: 21 January 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.12.030
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representing trees of higher degree
- The extendible cell method for closest point problems
- Dynamic multi-dimensional data structures based on quad- and k-d trees
- Analytic variations on quadtrees
- Quad trees: A data structure for retrieval by composite keys
- Partial match queries in relaxed multidimensional search trees
- Squarish k-d Trees
- Balanced Aspect Ratio Trees: Combining the Advantages of k-d Trees and Octrees
- A Self-adjusting Data Structure for Multidimensional Point Sets
- Updating relaxed K -d trees
- Multidimensional Height-Balanced Trees
- Improving the performance of multidimensional search using fingers
- SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
- Improved master theorems for divide-and-conquer recurrences
- Multidimensional binary search trees used for associative searching
- Analysis of the space of search trees under the random insertion algorithm
- On the average performance of orthogonal range search in multidimensional data structures
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Self-Adjusting k-ary Search Trees
- Partial match retrieval of multidimensional data
- Quad-K-d Trees
- Partial Match Queries in Random k-d Trees
- Analysis of range search for random \(k-d\) trees
This page was built for publication: Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
