Ekaterina A. Serebrovskaya, Ilia K. Marchevsky, Mariya A. Erofeeva

Bauman Moscow State Technical University

An algorithm for optimizing the path length on a triangulated surface has been proposed and implemented in Wolfram Mathematica. The first two steps are “lightweight” and involve varying the path along the edges only within the triangles adjacent to them. Subsequent steps allow arriving at a shortest path in the mathematical sense in a few iterations. The convergence of the algorithm has not been rigorously proven, but has been ensured in a large number of examples considered.

shortest path, triangulated surface, conditional optimization, Wolfram Mathematica