Article · Wikipedia archive · Last revised Jul 16, 2026

Adaptive k-d tree

An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.

Last revised

Jul 16, 2026

Read time

≈ 1 min

Length

54 w

Citations

—

Source

An adaptive k-d tree is a tree for multidimensional points where successive levels may be split along different dimensions.

References

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.