Add implementation of fast approximation of LB problems #13
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Inspired by #9, this PR implements the general strategy for fast approximation of Laplace-Beltrami eigenproblems proposed in (Nasikun, 2018) (TODO: check if general methodology was proposed before and this paper only brings new ways of computing distances; if yes update references/namings)
Computation of distance is pluggable (use any from #11).
I haven't implemented yet the variants of Dijsktra they suggest. Dijsktra with corrected distances is trivial and we should implement it fast. I've implemented a weird version of Dijsktra that always selects the same number of neighbors for the support of the local functions (probably useless and behaving poorly, but fun to implement nonetheless).
Haven't explored much the local transform, probably need to correct that part for considering the support.
Notice (Magnet, 2023) uses this, but with a different distance.
We can probably bring the notion of a
HierarchicalMesh
based on the sampling of a mesh here (SampledBasedHierarchicalMesh
?).