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

Sparsification strategy #2

Open

Godofnothing opened this issue Dec 8, 2020 · 0 comments

Owner

Godofnothing commented Dec 8, 2020

We need to implement a cheap and fast way for a decent approximation of the cost matrix.

Possible suggestions

During the construction of the cost matrix build adjacency matrix only for k-nearest to the given point
Decomposition into block domains with further refinement
Skeleton approximation?

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