You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
May I ask, based on your paper and open-source code, how to select k neighbor points within a specified radius? If the number of neighbor points within the specified radius does not reach k, what should I do? Or, if I have a problem with my understanding, what should I do
The text was updated successfully, but these errors were encountered:
Thanks for your interest. Indeed, I mainly rely on the pre-defined neighborhood search of the network.
That is, if the network (e.g., ConvNet) uses radius-search, I would consider all boundary points within this radius neighbor. Similarly, for k-nn search, I would consider all boundary points in this neighbor of k points.
May I ask, based on your paper and open-source code, how to select k neighbor points within a specified radius? If the number of neighbor points within the specified radius does not reach k, what should I do? Or, if I have a problem with my understanding, what should I do
The text was updated successfully, but these errors were encountered: