Adaptive k-d tree

From The Right Wiki
Revision as of 16:31, 26 March 2024 by imported>Jlwoodwa (tag as one source)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigationJump to search

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.