n-Ellipses and the Minimum Distance Sum Problem

DOI10.2307/2589675MaRDI QIDQ2757353zbMATH OpenOpenAlexFDO

Authors J. Sekino

Publication date 26 November 2001

Published in American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2589675

zbMATH Keywords

\(n\)-ellipsescurves with more focigeneralized ellipses

Mathematics Subject Classification ID

Euclidean analytic geometry (51N20)

Recommendations

• On a lower and upper bound for the curvature of ellipses with more than two foci
• scientific article; zbMATH DE number 3759045
• On Generalizations of Conics and on a Generalization of the Fermat- Torricelli Problem
• A three-point generalization of the ellipse
• Symmetric \(k\)-ellipses with limiting eccentricity

Cited in

(13)

• Symmetric \(k\)-ellipses with limiting eccentricity
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• On minimum- and maximum-weight minimum spanning trees with neighborhoods
• Classical curve theory in normed planes
• Minmax-distance gathering on given meeting points
• scientific article; zbMATH DE number 175728 (Why is no real title available?)
• Smallest Ellipsoid Containing $p$-Sum of Ellipsoids With Application to Reachability Analysis
• Minimizing inside a triangle with GeoGebra
• New fixed figure results with the notion of k-ellipse
• Subdivision methods for sum-of-distances problems: Fermat-Weber point, \(n\)-ellipses and the min-sum cluster Voronoi diagram (media exposition)
• On the images of n-ellipses under the Möbius transformations
• On the location of the minimum point in the Euclidean distance sum problem
• Steiner reducing sets of minimum weight triangulations: Structure and topology

This page was built for publication: n-Ellipses and the Minimum Distance Sum Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2757353)