Abstract
We provide a method to find a weighted Steiner minimal tree for convex quadrilaterals on a two-dimensional hemisphere of radius , for and the two dimensional hyperbolic plane of constant Gaussian Curvature K, for by introducing a method of cyclical differentiation of the objective function with respect to four variable angles. By applying this method, we find a generalized solution to a problem posed by C.F. Gauss in the spirit of weighted Steiner trees.
References
- I. D. Berg, I. G. Nikolaev: On an extremal property of quadrilaterals in an Aleksandrov space of curvature ≤ K, in: The Interaction of Analysis and Geometry (Novosibirsk, 2004), V. I. Burenkov et al. (ed.), Contemp. Math. 424, AMS, Providence (2007) 1–15.https://doi.org/10.1090/conm/424/08092Google Scholar
- V. Boltyanski, H. Martini, V. Soltan: Geometric Methods and Optimization Problems, Kluwer, Dordrecht (1999).https://doi.org/10.1007/978-1-4615-5319-9Google Scholar
- K. Bopp: Über das kürzeste Verbindungssystem zwischen vier Punkten, Dissertation, Universität Göttingen, Göttingen (1879).Google Scholar
- D. Cieslik: Shortest Connectivity. An Introduction with Applications in Phylogeny, Springer, New York (2005).Google Scholar
- R. Courant, H. Robbins: What is Mathematics?, Oxford University Press, New York (1951).Google Scholar
- E. N. Gilbert, H. O. Pollak: Steiner minimal trees, SIAM J. Appl. Math. 16 (1968) 1–29.https://doi.org/10.1137/0116001Google Scholar
- A. N. Zachos, G. Zouzoulas: The weighted Fermat-Torricelli problem and an "inverse" problem, J. Convex. Analysis 15(1) (2008) 55–62.https://doi.org/10.68381/jca15004Google Scholar
Suggested citation
Published by Heldermann Verlag, 2011. Rights now held by Banach Press LLC.
