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

Sorting Techniques #4

Open

sjkelly opened this issue Nov 2, 2019 · 2 comments · Fixed by #9

Member

sjkelly commented Nov 2, 2019

Ideas to reduce the cache pressure during point lookup:

where:

Perform initially
Perform between iterations upon some criteria being met

what:

binning
KD Trees

Member Author

sjkelly commented Nov 19, 2019

brio-hilbert

sjkelly mentioned this issue

Merged

sjkelly closed this as completed in #9

sjkelly reopened this

Member Author

sjkelly commented Jan 25, 2020

I realize the sorting is not multiscale. This should be multiscale hilbert sort, not just pure hilbert.

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