Abstract:
It is proved that any locally minimal tree on Euclidean space can be “stabilized” (i.e., rendered shortest) by adding boundary vertices without changing the initial tree as a set in space. This result is useful for constructing examples of shortest trees.
Keywords:Steiner's problem, Steiner minimal tree, shortest tree, shortest network, framed network, Euclidean network, stabilization of a network.