Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

get closest points from query point #11

Open
PerspectivesLab opened this issue Dec 8, 2021 · 0 comments
Open

get closest points from query point #11

PerspectivesLab opened this issue Dec 8, 2021 · 0 comments

Comments

@PerspectivesLab
Copy link

PerspectivesLab commented Dec 8, 2021

Hi, i have a query point set and a second point set,
for each points in the query, i am asking the closest points of the second set, in the radius of 1.0
i can see i am limited to 70 neighbours, but what if they are more :

  • are the 70 points classified by euclidian distance ?
  • are they the 70 closest, or 70 points randomly taken ?

what would be the best strategy to recover ALL Neighbors from the radius ( 50k ? ) and => classify them by distance for the given radius => in order to have the 70 closest points ? ( CUDA_MAX_NEIGHBORS )

i understand there is a theory of sorting the points by "space-filling Z curve" how does it differ from euclidian distance ?

by reading "FAST FIXED-RADIUS NEAREST NEIGHBORS: INTERACTIVE MILLION-PARTICLE FLUIDS"
i understand there a way of "Finding all neighbors in a fixed radius R" or is there a limitation ?

thank you !

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant