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

DBSCAN algorithm improvements #417

Closed

aprokop opened this issue Oct 24, 2020 · 0 comments

Labels

Contributor

aprokop commented Oct 24, 2020 •

edited

Loading

[DONE] ~~Early termination of neighbor counting Feature proposal: allow early termination of traversal #407~~ (done in Enable early termination of the tree traversal for spatial predicates #427, Terminate DBSCAN's neighbor counting early once threshold is reached #428).
Pair traversal Improve traversal algorithm when interested only in pairs as a result #409, Accelerate tree traversal in auto collision problems #485
[optional] Loop only over core points comment
[DONE] ~~Postprocessing~~ (done in Speed up DBSCAN post-processing #430, Update DBSCAN post-processing to avoid calling sort #453)
(potential) Feature proposal: separate leaf and internal nodes #437
(potential) Rebuild tree only for core points for DBSCAN
dense box algorithm (Introduce new algorithm (FDBSCAN-DenseBox) for DBSCAN #508)
grid based methods

aprokop added the performance label

aprokop closed this as completed

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