Re: computing geodesic on various manifolds, algorithm for

On Tue, 29 Nov 2005 13:02:18 -0500, "g.wall" <wallge@xxxxxxxxxxx>
wrote:
>does anyone know where i can find a good paper for the novice (im an EE)
>on computing geodesics, or maybe a good algorithm outline for this?

Geodesics are relatively easy in spaces with constant curvature, like
a plane or the surface of a sphere. But if the curvature varies, the
task becomes much more difficult: solving a differential equation as
an initial value problem.

One approach is to look for a straightest path; this is done locally,
step by step. Another approach is to look for a shortest path; this
can be mix global and local tactics.

If the geodesic is required to go from a given start to a given end,
the initial value problem becomes a (more difficult still) boundary
value problem. Think of putting in golf, only with undulating greens.

.

Relevant Pages