On the surface of a regular tetrahedron of edge length 1 are given finitely many segments such that every two vertices of the tetrahedron can be joined by a polygonal line consisting of given segments. Can the sum of the lengths of the given segments be less than 1+3? geometry3D geometrytetrahedroncombinatorial geometry