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.
>>16259387Geodesic equation is just a differential equation. There are dozens of algorithms for approximating solutions it a differential equation.
>>16259387Do you have the metric for the surface?
>>16259387the surface obviously needs to be convex, retard