Dynamic multi-dimensional data structures based on quad- and k-d trees
From MaRDI portal
Publication:1166932
DOI10.1007/BF00264354zbMath0489.68055MaRDI QIDQ1166932
Mark H. Overmars, Jan van Leeuwen
Publication date: 1982
Published in: Acta Informatica (Search for Journal in Brave)
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items (13)
Amortized analysis of smooth quadtrees in all dimensions ⋮ Efficient dynamic range searching using data replication ⋮ Verified Root-Balanced Trees ⋮ Cellular tree classifiers ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ Maintaining α-balanced trees by partial rebuilding ⋮ Concatenable segment trees ⋮ Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees ⋮ Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Divided \(k-d\) trees ⋮ Updating approximately complete trees ⋮ Data analysis using a geometrical representation of predicate calculus ⋮ Efficient splitting and merging algorithms for order decomposable problems.
This page was built for publication: Dynamic multi-dimensional data structures based on quad- and k-d trees
