Closed Locally Minimal Networks on the Surfaces of Convex Polyhedra

N. P. Strelkova

Modelirovanie i analiz informacionnyh sistem, Tome 20 (2013) no. 5, pp. 117-147

Résumé

Closed locally minimal networks can be viewed as “branching” closed geodesics. We study such networks on the surfaces of convex polyhedra and discuss the problem of describing the set of all convex polyhedra that have such networks. A closed locally minimal network on a convex polyhedron is an embedding of a graph provided that all edges are geodesic arcs and at each vertex exactly three adges meet at angles of $120^{\circ}$. In this paper, we do not deal with closed (periodic) geodesics. Among other results, we prove that the natural condition on the curvatures of a polyhedron that is necessary for the polyhedron to have a closed locally minimal network on its surface is not sufficient. We also prove a new stronger necessary condition. We describe all possible combinatorial structures and edge lengths of closed locally minimal networks on convex polyhedra. We prove that almost all convex polyhedra with vertex curvatures divisible by $\frac{\pi}{3}$ have closed locally minimal networks.

Détail

Keywords: locally minimal network, geodesic net, convex polyhedron.