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.

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

Implement lower complexity verify_min_distance #10

Open
bblankrot opened this issue Mar 4, 2018 · 0 comments
Open

Implement lower complexity verify_min_distance #10

bblankrot opened this issue Mar 4, 2018 · 0 comments

Comments

@bblankrot
Copy link
Owner

Currently, this is an O(M^2) algorithm. This can be improved substantially, for example by recursively subdividing the domain or by using an FMM-type approach (divide into boxes of size d_min, and then check only near neighbors).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@bblankrot