Adaptive k-d tree
An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.
References[]
- Samet, Hanan (2006). Foundations of multidimensional and metric data structures. Morgan Kaufmann. ISBN 978-0-12-369446-1.
This article incorporates public domain material from the NIST document: Black, Paul E. "Adaptive k-d tree". Dictionary of Algorithms and Data Structures.
 | This computer-programming-related article is a stub. You can help Wikipedia by . |
Categories:
- Trees (data structures)
- Geometric data structures
- Algorithms and data structures stubs
- Computer programming stubs