Multidimensional balanced binary trees
From MaRDI portal
Recommendations
Cited in
(17)- On the Height of Multidimensional Height-Balanced Trees
- Simple algorithms for the on-line multidimensional dictionary and related problems
- scientific article; zbMATH DE number 3845065 (Why is no real title available?)
- Height-analysis of k-dimensional leaf and node height-balanced trees: A new approach
- Rank-Balanced Trees
- On k-dimensional balanced binary trees.
- scientific article; zbMATH DE number 219270 (Why is no real title available?)
- Balanced aspect ratio trees: Combining the advantages of k-d trees and octrees
- Balanced ordered trees
- A counter example to a monotonicity property of k-d trees
- A self-adjusting data structure for multidimensional point sets
- scientific article; zbMATH DE number 4135388 (Why is no real title available?)
- Algorithms for BD trees
- Transforming unbalanced multiway trees into a practical external data structure
- Multidimensional trees
- Generalized k-d-trees and local reorganizations
- Edge estimation in the population of a binary tree using node-sampling
This page was built for publication: Multidimensional balanced binary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732091)