THE TASK AT HAND:

Consider triangle ABC, find a point P such that the sum of the distances
from P to each of the three vertices is a minimum.

Given any triangle ABC:

Sorry, this page requires a Java-compatible web browser.


Construct equilateral triangles ABD, BCE,  and CAF :

Sorry, this page requires a Java-compatible web browser.





Construct segments DC, EA, and FB.  The intersection of DC, EA, and FB creates point P :

Sorry, this page requires a Java-compatible web browser.



 Final Product produces AP+BP+CP= the minimum sum of distances between the three vertices:

Sorry, this page requires a Java-compatible web browser.




Why does this work?  Investigate A Proof!
There are several ways to prove this problem.  In researching,
I found that one web site does an excellent job of providing alternate
examples of proofs and investigations called
The Fermat Point and Generalizations!

CHECK IT OUT!


EXPLORE!  |  COMPARE!  | CONSTRUCTION  | PROOF | Shauna's Homepage