Analysis of kdt-trees: kd-trees improved by local reorganisations
From MaRDI portal
(Redirected from Analysis of kdt-trees: kd-trees improved by local reorganisations)
Analysis of \(k\)d\(t\)-trees: \(k\)d-trees improved by local reorganisations
Analysis of \(k\)d\(t\)-trees: \(k\)d-trees improved by local reorganisations
Recommendations
- Generalized k-d-trees and local reorganizations
- Analysis of range search for random \(k-d\) trees
- Partial match retrieval of multidimensional data
- Choosing optimal branching factors for k-d-B trees
- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
Cited in
(16)- Choosing optimal branching factors for k-d-B trees
- Distributed searching of multi-dimensional data: A performance evaluation study
- The DR-tree: A main memory data structure for complex multi-dimensional objects
- On the cost of fixed partial match queries in K-d trees
- Use of the spatial kD-tree in computational physics applications
- Generalized k-d-trees and local reorganizations
- scientific article; zbMATH DE number 2013334 (Why is no real title available?)
- scientific article; zbMATH DE number 1875355 (Why is no real title available?)
- On the average performance of orthogonal range search in multidimensional data structures
- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
- Partial match retrieval of multidimensional data
- Quad-K-d trees
- Analysis of range search for random \(k-d\) trees
- Median and hybrid median K-dimensional trees
- A counter example to a monotonicity property of k-d trees
- Quad-k d trees: a general framework for k d trees and quad trees
This page was built for publication: Analysis of \(k\)d\(t\)-trees: \(k\)d-trees improved by local reorganisations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028872)
