Open dhorka opened 2 years ago
(long-delayed response in case it's useful for others)
I'd suggest simply calling these algorithms in a for-loop over all vertices. The underlying algorithms do not have offer any special accelerations for the case of computing all-pairs distance. We could add a helper function for all-pairs, but it would just be a for-loop in C++ :) it might save a little overhead (so I'd be happy to take a PR adding it), but not a ton.
The stateful heat geodesic solver takes advantage of precomputation, so it should be reasonably fast for this intended use case.
Hi,
I would like to get the geodesic pairwise distance of a mesh. I saw that there are some methods to get the distance for a specific each. However, I did not see how to get efficiently the pairwise distance.
Thanks,