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.

Sign up for GitHub

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

Jump to bottom

Downsampling routines + tests #43

Open

5 tasks done

Algomorph opened this issue Jul 5, 2022 · 0 comments

Assignees

Labels

feature

Owner

Algomorph commented Jul 5, 2022 •

edited

Loading

Necessary for proper node topological updates, it is imperative we get this right.

Finish elementary radius-based (epsilon) downsampling (based on existing grid downsampling code)

Perhaps make a version that exploits spatial hash map instead of a linear bin array. This will involve:

Write a routine that determines how many maximum points we might have per "epsilon-radius" block
Write a kernel routine for aggregating points into hash blocks
Write a kernel routine for averaging points within each block
Write a kernel routine for checking block neighbors and merging neighboring blocks' points if they are within epsilon

Algomorph self-assigned this

Algomorph added the feature label

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment