It is well known that length-minimizing networks in R2 consist of segments meeting only in threes. This paper considers uniformly convex norms Π more general than length. The first theorem says that for any such smooth Π, minimizing networks still meet only in threes. The second theorem shows that for some piecewise smooth Π, segments can meet in fours (although never in fives or more). © 1991 by Pacific Journal of Mathematics.
CITATION STYLE
Alfaro, M., Conger, M., Hodges, K., Levy, A., Kochar, R., Kuklinski, L., … Von Haam, K. (1991). The structure of singularities in Π-minimizing networks in R2. Pacific Journal of Mathematics, 149(2), 201–210. https://doi.org/10.2140/pjm.1991.149.201
Mendeley helps you to discover research relevant for your work.