Skip to main content
Ctrl+K

napf 0.1.0 documentation

  • Github
  • API Reference
  • Github
  • API Reference

Section Navigation

  • napf
    • napf.base
      • napf.base.core_class_str_and_data
      • napf.base.enforce_contiguous
      • napf.base.validate_metric_input
      • napf.base.KDT
        • napf.base.KDT.knn_search
        • napf.base.KDT.newtree
        • napf.base.KDT.query
        • napf.base.KDT.query_ball_point
        • napf.base.KDT.radii_search
        • napf.base.KDT.radius_search
        • napf.base.KDT.rknn_search
        • napf.base.KDT.unique_data_and_inverse
        • napf.base.KDT.core_tree
        • napf.base.KDT.dtype
        • napf.base.KDT.nthread
        • napf.base.KDT.tree_data
  • API References
  • napf.base.KDT
  • napf.base.KD...

napf.base.KDT.rknn_search#

KDT.rknn_search(queries, radius, n_nearest, nthread=None)[source]#

Searches for k-nearest neighbors within the radius. With insufficient neighbors, rest of the return values will have dummy filled in - they will be the maximum value of each data type. If the dtype is signed, it will have a negative value.

Parameters:
  • queries ((m, d) np.ndarray)

  • radius (float)

  • n_nearest (int)

  • nthread (int)

Returns:

ids_and_distances –

((m, 1) np.ndarray - uint ids,

(m, 1) np.ndarray - double dists)

Return type:

tuple

previous

napf.base.KDT.radius_search

next

napf.base.KDT.unique_data_and_inverse

On this page
  • KDT.rknn_search()
Show Source

© Copyright 2022, Jaewook Lee.

Created using Sphinx 7.4.7.

Built with the PyData Sphinx Theme 0.15.4.