BI商业智能>> kdtree>> 返回
项目作者： alesanfra

项目描述 ：
Multidimensional binary search tree for associative searching
高级语言： Python
项目地址: git://github.com/alesanfra/kdtree.git
创建时间： 2020-11-05T20:15:49Z
项目社区：https://github.com/alesanfra/kdtree
开源协议：GNU General Public License v3.0
下载


Build
Quality Gate Status
codecov

KDTree

Implementation of a multidimensional binary search tree for associative searching

References

Jon Louis Bentley. Multidimensional binary search tree used for associative searching. September 1975.

Usage

  1. from kdtree import BinSearchTree, Bound, Node, Region
  4. # Create a new tree
  5. tree = BinSearchTree(dimension=2)
  7. # Insert some nodes into the tree
  8. tree.insert(Node((50, 50)))
  9. tree.insert(Node((10, 70)))
  10. tree.insert(Node((80, 85)))
  11. tree.insert(Node((25, 20)))
  12. tree.insert(Node((40, 85)))
  13. tree.insert(Node((70, 85)))
  14. tree.insert(Node((10, 60)))
  16. # Create rectangle from a bound array as described in the article
  17. # Element 2*j is lower bound and element (2*j)+1 is upper bound of dimension j
  18. rectangle_1 = Region.from_bounds_array(69, 71, 84, 86)
  20. # Create rectangles as a list of Bound object
  21. rectangle_2 = Region(Bound(69, 71), Bound(84, 86))
  23. # Search
  24. nodes = tree.regional_search(rectangle_1)
  25. print("Nodes within region:", nodes)