On a lower and upper bound for the curvature of ellipses with more than two foci (Q2474001): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Convex analysis and nonlinear optimization. Theory and examples / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3266883 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Generalizations of Conics and on a Generalization of the Fermat- Torricelli Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Fermat-Steiner Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3954445 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polyconics. I. Polyellipses and optimization / rank | |||
Normal rank |
Latest revision as of 18:17, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a lower and upper bound for the curvature of ellipses with more than two foci |
scientific article |
Statements
On a lower and upper bound for the curvature of ellipses with more than two foci (English)
0 references
5 March 2008
0 references
The authors consider special convex curves in the Euclidean plane which are a generalization of an ellipse. The essential property of an ellipse is the existence of two foci. A point of an ellipse has the property that the sum \(F\) of the distances of the two foci is constant. Generalizing this property the authors consider a set of \(n \;(\geq 3)\) points in the Euclidean plane, called foci. The levels of the function \(F\) which meassure the sum of the distances from the foci are called polyellipses. If there exist only one focus the curve is a circle. In this paper the polyellipses are investigated from the viewpoint of differential geometry. Some examples explain properties of polyellipses. Results on the curvature of the polyellipses are presented. A lower and an upper bound for the curvature involving explicite constants are given. They depend on the number of foci, the rate of the level, and the global minimum of the function \(F\). When \(n = 3\) the minimum of \(F\) is the Fermat point. For the classical theorem of \textit{E. Weiszfeld} [Tohoku Math. J. 43, 355--386 (1937; Zbl 0017.18007)] characterizing the minimizer of the function \(F\) a new proof is given. As an application a new proof for a theorem of \textit{P. Erdős} and \textit{I. Vincze} [Math. Lapok 9, 19--36 (1958; Zbl 0091.35402)] is presented. This theorem states that the approximation of a regular triangle by circumscribed polyellipses has an absolute error in the sence that there is no way to exceed it even if the number of the foci are arbitrary large.
0 references
curvature
0 references
extremum problems
0 references
approximation by convex sets
0 references