Computational of Shortest Path by Using Geodesic Triangulations on Polyhedral Surface

摘要

Geodesic is the shortest path connecting two given points on polyhedral surface and it can be also be regarded as the extremal curve of the arc length functional. we will show the algorithm of the approximate solution for computing both the shortest path between two points and between a point and a curve.