Adaptive k-d tree

Add links
From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Toddst1 (talk | contribs) at 14:33, 14 February 2019 (|authorlink=Hanan Samet). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 computer-programming-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Adaptive_k-d_tree&oldid=883294335"