Dynamic multi-dimensional data structures based on quad- and k-d trees

DOI10.1007/BF00264354MaRDI QIDQ1166932zbMATH OpenFDO

Authors Mark H. Overmars, J. Van Leeuwen

Publication date 1982

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00264354

zbMATH Keywords

deletionsinsertionsk-d treespseudo quad-treequad-tree

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(13)

• Divided \(k-d\) trees
• Amortized analysis of smooth quadtrees in all dimensions
• Efficient splitting and merging algorithms for order decomposable problems.
• Efficient dynamic range searching using data replication
• Maintaining α-balanced trees by partial rebuilding
• Cellular tree classifiers
• Updating approximately complete trees
• Efficient splitting and merging algorithms for order decomposable problems
• Verified Root-Balanced Trees
• Concatenable segment trees (extended abstract)
• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
• Data analysis using a geometrical representation of predicate calculus
• Quad-k d trees: a general framework for k d trees and quad trees

This page was built for publication: Dynamic multi-dimensional data structures based on quad- and k-d trees

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