Quad-k d trees: a general framework for k d trees and quad trees

DOI10.1016/J.TCS.2015.12.030MaRDI QIDQ906406zbMATH OpenOpenAlexFDO

Authors Nikolett Bereczky, Amalia Duch, Krisztián Németh, Salvador Roura

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

zbMATH Keywords

multidimensional data structuresassociative retrieval\(k\mathrm d\) treesquad trees

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Data structures (68P05)

Recommendations

• Quad-K-d trees
• Random partial match in quad-K-d trees
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Divided \(k-d\) trees
• scientific article; zbMATH DE number 140456

Cites work

• scientific article; zbMATH DE number 140456 (Why is no real title available?)
• scientific article; zbMATH DE number 1052006 (Why is no real title available?)
• scientific article; zbMATH DE number 1559577 (Why is no real title available?)
• scientific article; zbMATH DE number 2173815 (Why is no real title available?)
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• A self-adjusting data structure for multidimensional point sets
• Analysis of range search for random \(k-d\) trees
• Analysis of the space of search trees under the random insertion algorithm
• Analytic variations on quadtrees
• Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
• Dynamic multi-dimensional data structures based on quad- and k-d trees
• Improved master theorems for divide-and-conquer recurrences
• Improving the performance of multidimensional search using fingers
• Multidimensional Height-Balanced Trees
• Multidimensional binary search trees used for associative searching
• On the average performance of orthogonal range search in multidimensional data structures
• Partial Match Queries in Random k-d Trees
• Partial match queries in relaxed multidimensional search trees
• Partial match retrieval of multidimensional data
• Quad trees: A data structure for retrieval by composite keys
• Quad-K-d trees
• Representing trees of higher degree
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• Self-Adjusting k-ary Search Trees
• Squarish \(k\)-\(d\) trees
• Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
• The extendible cell method for closest point problems
• Updating relaxed K-d trees

Cited in

(14)

• On the expected cost of partial match queries in random quad-K-d trees
• scientific article; zbMATH DE number 3852447 (Why is no real title available?)
• scientific article; zbMATH DE number 1670657 (Why is no real title available?)
• Fringed-quadtrees: a new kind of data structure
• Quad-Trees and Linear Lists for Identifying Nondominated Criterion Vectors
• Algorithms and Computation
• Study of the universal constants for the multidimensional search quadtrees
• Dynamic smooth compressed quadtrees
• SKIP QUADTREES: DYNAMIC DATA STRUCTURES FOR MULTIDIMENSIONAL POINT SETS
• The skip quadtree
• Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
• Page usage in a quadtree index
• Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
• Quad-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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q906406)