This is the continuous
version of the constrained shortest path problem. We are given a polyhedral
surface and are looking for a geodesic shortest path between two nodes. In the
weighted version we also have face weights and the cost of a path link is its
euclidean length multiplied with the weight of the face it passes through. We
now have two weight functions w1 and w2 defined on the faces and are looking for
a geodesic path of minimal w1-weighted cost and limited w2-weighted resource.
Constrained geodesic shortest paths path of minimal unweighted
euclidean distance(green) and path of minimal slope weighted heightdifference
(red)
gmx.de