Misplaced Pages

Adaptive k-d tree

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.

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)

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 Paul E. Black. "Adaptive k-d tree". Dictionary of Algorithms and Data Structures. NIST.

This algorithms or data structures-related article is a stub. You can help Misplaced Pages by expanding it.

v
t
e

This computer-programming-related article is a stub. You can help Misplaced Pages by expanding it.

v
t
e