Adaptive k-d tree
From Wikipedia, the free encyclopedia
This article relies largely or entirely on a single source . Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Adaptive k-d tree" – news · newspapers · books · scholar · JSTOR (March 2024)
Find sources: "Adaptive k-d tree" – news · newspapers · books · scholar · JSTOR (March 2024)
An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.
References
[edit ]- Samet, Hanan (2006). Foundations of multidimensional and metric data structures. Morgan Kaufmann. ISBN 978-0-12-369446-1.
Public Domain This article incorporates public domain material from Paul E. Black. "Adaptive k-d tree". Dictionary of Algorithms and Data Structures . NIST.
Stub icon
This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.
Stub icon
This computer-programming-related article is a stub. You can help Wikipedia by expanding it.