yt.utilities.lib.cykdtree package¶
Submodules¶
- yt.utilities.lib.cykdtree.kdtree module
PyKDTreePyKDTree.nptsPyKDTree.ndimPyKDTree.data_versionPyKDTree.num_leavesPyKDTree.leafsizePyKDTree.leavesPyKDTree.idxPyKDTree.left_edgePyKDTree.right_edgePyKDTree.domain_widthPyKDTree.periodicPyKDTree.assert_equal()PyKDTree.consolidate_edges()PyKDTree.data_versionPyKDTree.domain_widthPyKDTree.from_file()PyKDTree.get()PyKDTree.get_neighbor_ids()PyKDTree.idxPyKDTree.leaf_idx()PyKDTree.leafsizePyKDTree.leavesPyKDTree.left_edgePyKDTree.ndimPyKDTree.nptsPyKDTree.num_leavesPyKDTree.periodicPyKDTree.right_edgePyKDTree.save()
PyNodePyNode.nptsPyNode.ndimPyNode.num_leavesPyNode.start_idxPyNode.stop_idxPyNode.left_edgePyNode.right_edgePyNode.periodic_leftPyNode.periodic_rightPyNode.domain_widthPyNode.left_neighborsPyNode.right_neighborsPyNode.assert_equal()PyNode.domain_widthPyNode.idPyNode.left_edgePyNode.left_neighborsPyNode.ndimPyNode.neighborsPyNode.nptsPyNode.num_leavesPyNode.periodic_leftPyNode.periodic_rightPyNode.right_edgePyNode.right_neighborsPyNode.slicePyNode.start_idxPyNode.stop_idx
- yt.utilities.lib.cykdtree.plot module
- yt.utilities.lib.cykdtree.utils module
Module contents¶
- yt.utilities.lib.cykdtree.make_tree(pts, **kwargs)[source]¶
Build a KD-tree for a set of points.
- Parameters:
pts (np.ndarray of float64) – (n,m) Array of n mD points.
**kwargs – Additional keyword arguments are passed to the appropriate class for constructuing the tree.
- Returns:
KDTree object.
- Return type:
T (
cykdtree.PyKDTree)- Raises:
ValueError – If pts is not a 2D array.