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)

zbMATH Keywords

deletionsinsertionsquad-treek-d treespseudo quad-tree

Mathematics Subject Classification ID

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

Cited in

(13)

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