🧵 Generalized shortest distance algorithm
Anonymous at Sat, 29 Jun 2024 06:38:58 UTC No. 16259387
I am trying to find an algorithm to take any non-intersecting n-dimensional surface and find the shortest path between any two unique points on its surface. I have not been able to find or create a solution; if anyone here can think of one, please reply as i am starting to think the problem is not possible to solve.
Anonymous at Sat, 29 Jun 2024 08:01:42 UTC No. 16259467
>>16259387
Geodesic equation is just a differential equation. There are dozens of algorithms for approximating solutions it a differential equation.
Anonymous at Sat, 29 Jun 2024 16:14:50 UTC No. 16259971
>>16259387
Do you have the metric for the surface?
Anonymous at Sun, 30 Jun 2024 07:21:02 UTC No. 16260806
>>16259387
the surface obviously needs to be convex, retard