Timeline for Determining geodesics between two points in curved space
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Nov 4, 2015 at 9:15 | comment | added | Vladimir S Matveev | I possibly misunderstood your question since the trivial answer is to compute the length of all such geodesics, compare, and choose the shortest one, or in fact your programm should already do it since the length is simply the time $s$ one need to go along the geodesic starting at the first point to hit the second point divided by the length of the initial velocity vector. | |
| Nov 3, 2015 at 19:20 | comment | added | imranal | If many geodesic are found by the brute force procedure, how does one determine the geodesic with the shortest path ? | |
| Nov 3, 2015 at 19:18 | vote | accept | imranal | ||
| Nov 3, 2015 at 15:27 | comment | added | imranal | It is. I will take a look at curve shortening flow. | |
| Nov 3, 2015 at 14:45 | comment | added | Vladimir S Matveev | Is you connection the Levi-Civita connection of a Riemannian metric? Otherwise your way is essentially the only one | |
| Nov 3, 2015 at 14:42 | comment | added | imranal | I have in fact managed to implement a numerical solution for the system of ODE's : scicomp.stackexchange.com/questions/21103/… . I was thinking about geodesics between two points, since I want to improve the code, as to permit the user more options. I have made a brute force method where I try to find the second point by iterating a "gazillion" (u',v') values. I halt the execution after finding the first pair (u',v'). Here is the code : pastebin.com/WJ5XdSxS | |
| Nov 3, 2015 at 14:23 | history | answered | Vladimir S Matveev | CC BY-SA 3.0 |