scientific article; zbMATH DE number 140456
From MaRDI portal
Publication:4028872
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
(15)- A counter example to a monotonicity property of k-d trees
- Choosing optimal branching factors for k-d-B trees
- Median and hybrid median \(K\)-dimensional trees
- Quad-\(K\)-d trees
- scientific article; zbMATH DE number 2013334 (Why is no real title available?)
- Partial match retrieval of multidimensional data
- Quad-\(k\mathrm d\) trees: a general framework for \(k\mathrm d\) trees and quad trees
- Use of the spatial \(k\)D-tree in computational physics applications
- Gkd-trees: Binary trees that combine multi-dimensional data handling, node size and fringe reorganization
- Generalized \(k\)-\(d\)-trees and local reorganizations
- On the average performance of orthogonal range search in multidimensional data structures
- On the cost of fixed partial match queries in \(K\)-d trees
- scientific article; zbMATH DE number 1875355 (Why is no real title available?)
- The DR-tree: A main memory data structure for complex multi-dimensional objects
- Analysis of range search for random \(k-d\) trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028872)
