Adaptive k-d tree

From Wikipedia, the free encyclopedia

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.

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 adding missing information.

Stub icon

This computer-programming-related article is a stub. You can help Wikipedia by adding missing information.

Related Articles

Wikiwand AI