Skip Navigation


IMA Journal of Management Mathematics Advance Access originally published online on April 11, 2006
IMA Journal of Management Mathematics 2006 17(4):387-396; doi:10.1093/imaman/dpl007
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
17/4/387    most recent
dpl007v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Plastria, F.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The authors 2006. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Four-point Fermat location problems revisited. New proofs and extensions of old results

Frank Plastria**

MOSI Vrije Universiteit Brussel Pleinlaan 2, B 1050 Brussels, Belgium

** Email: frank.plastria{at}vub.ac.be

What is the point at which the sum of (Euclidean) distances to four fixed points in the plane is minimised? This extension of the celebrated location question of Fermat about three points was partially solved by Fagnano around 1750, giving the following simple geometric answer: when the fixed points form a convex quadrangle it is the intersection point of both diagonals; it is not known who first derived the other case: otherwise it is the fixed point in the triangle formed by the three other fixed points. We show that the first case extends and generalises to general metric spaces, while the second case extends to any planar norm, any ellipsoidal norm in higher dimensional spaces and to the sphere.


Received January 2005. accepted on 16 December 2005.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.