Planar Manhattan Local Minimal and Critical Networks

One-dimensional branching extremals of Lagrangian-type functionals are considered. Such extremals appear as solutions to the classical Steiner problem on a shortest network, i.e., a connected system of paths that has the smallest total length among all the networks spanning a given finite set of terminal points in the plane. In the present paper, the Manhattan-length functional is investigated, with Lagrangian equal to the sum of the absolute values of projections of the velocity vector onto the coordinate axes. Such functionals are useful in problems arising in electronics, robotics, chip design, etc. In this case, in contrast to the case of the Steiner problem, local minimality does not imply extremality (however, each extreme network is locally minimal). A criterion of extremality is presented, which shows that the extremality with respect to the Manhattan-length functional is a global topological property of networks. Bibliography: 95 titles.

[1]  Ding-Zhu Du,et al.  Steiner minimal trees for regular polygons , 1987, Discret. Comput. Geom..

[2]  O. Ore.  Theory of Graphs , 1962 .

[3]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[4]  COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: Solution of the Steiner problem for convex boundaries , 1990 .

[5]  Alexandr O. Ivanov,et al.  Some Problems Concerning Minimal Networks , 1994, Int. J. Shape Model..

[6]  J. Hyam Rubinstein,et al.  The Steiner ratio conjecture for six points , 1991, J. Comb. Theory A.

[7]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[8]  F. K. Hwang,et al.  The Steiner Ratio Conjecture Is True for Five Points , 1985, J. Comb. Theory A.

[9]  A. Ivanov,et al.  Geometry and topology of local minimal 2-trees , 1997 .

[10]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[11]  F. Hwang,et al.  A linear time algorithm for full steiner trees , 1986 .

[12]  Ronald L. Graham,et al.  Steiner Trees on a Checkerboard , 1989 .

[13]  J. Hass,et al.  Geodesic nets on the 2-sphere , 1996 .

[14]  David S. Johnson,et al.  The Rectilinear Steiner Problem is NP-Complete , 1977 .

[15]  Wilhelm Klingenberg,et al.  Lectures on closed geodesics , 1978 .

[16]  Число вращения плоских линейных деревьев@@@The twist number of planar linear trees , 1996 .

[17]  Gary Lawlor,et al.  PAIRED CALIBRATIONS APPLIED TO SOAP FILMS, IMMISCIBLE FLUIDS, AND SURFACES OR NETWORKS MINIMIZING OTHER NORMS , 1994 .

[19]  Nicholas C. Wormald,et al.  Minimal Steiner Trees for Rectangular Arrays of Lattice Points , 1997, J. Comb. Theory, Ser. A.

[20]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[21]  A. Ivanov,et al.  Branching solutions to one-dimensional variational problems , 2001 .

[22]  E. Cockayne.  On the Steiner Problem , 1967, Canadian Mathematical Bulletin.

[23]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[24]  Alexander Ivanov.  Calibration forms and new examples of globally minimal surfaces , 1993 .

[25]  M. Beeson,et al.  The cusp catastrophe of thom in the bifurcation of minimal surfaces , 1984 .

[26]  Александр Олегович Иванов,et al.  Геометрия множества минимальных сетей данной топологии с фиксированной границей@@@The geometry of minimal networks with a given topology and a fixed boundary , 1997 .

[27]  Ding-Zhu Du,et al.  Steiner minimal trees on zig-zag lines , 1983 .

[28]  W. Meyer,et al.  Riemannsche Geometrie im Großen , 1975 .

[29]  Christos H. Papadimitriou,et al.  The 1-Steiner Tree Problem , 1987, J. Algorithms.

[30]  김원섭.  Minimizing cones and networks : immiscible fluids, norms, and calibrations , 1999 .

[31]  Ding-Zhu Du,et al.  A new bound for the steiner ratio , 1983 .

[32]  Nicholas C. Wormald,et al.  Full Minimal Steiner Trees on Lattice Sets , 1997, J. Comb. Theory, Ser. A.

[33]  Doreen A. Thomas,et al.  A variational approach to the Steiner network problem , 1991, Ann. Oper. Res..

[34]  K. Nomizu,et al.  Foundations of Differential Geometry , 1963 .

[35]  A. Ivanov,et al.  Minimal Networks: The Steiner Problem and Its Generalizations , 1994 .

[36]  Ding-Zhu Du,et al.  Steiner minimal trees on sets of four points , 1987, Discret. Comput. Geom..

[37]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[38]  R C Clark,et al.  Communication networks, soap films and vectors , 1981 .

[39]  D. Cieslik.  The Steiner Ratio of Metric Spaces , 2001 .

[40]  Frank K. Hwang,et al.  Hexagonal coordinate systems and steiner minimal trees , 1986, Discret. Math..

[41]  L. V. Hong.  Relative calibrations and the problem of stability of minimal surfaces , 1990 .

[42]  Stefan Hildebrandt,et al.  The Parsimonious Universe , 1996 .

[43]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.

[44]  K. Maurin.  The Plateau Problem , 1997 .

[45]  Le Khong Van.  MINIMAL Φ-LAGRANGIAN SURFACES IN ALMOST HERMITIAN MANIFOLDS , 1990 .

[46]  Ronald L. Graham,et al.  Steiner Trees for Ladders , 1978 .

[47]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[48]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .