Doctor of philosophy in mathematics: Shortest paths along a sequence of line segments and connected orthogonal convex hulls

In the dissertation, we consider the problem of finding the shortest path between two points along a sequence of adjacent triangles in a general setting. The sequence of triangles is replaced by a sequence of ordered line segments. The 3D space is replaced by a Euclidean space.