“Adaptive k-d tree”的意思、由来-开放百科全书

词条

Adaptive k-d tree

释义

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

References

{{cite book|last=Samet|first=Hanan|title=Foundations of multidimensional and metric data structures|year=2006|publisher=Morgan Kaufmann|isbn=978-0-12-369446-1|url=https://books.google.com/books?id=KrQdmLjTSaQC|authorlink=Hanan Samet}}

2 : Trees (data structures)|Geometric data structures

随便看

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。