Euclidean Steiner Problem w/ duality
- From: "Ken Honda" <Honda_Kiai@xxxxxxxxxxx>
- Date: 15 May 2005 00:37:54 -0700
Hello,
I'm interested in learning more about the Euclidean Steiner Problem,
which asks: given a set of points in the plane (or any Euclidean
space), what is the point that minimizes the sum of the distances from
the given points to the chosen point? I am aware that the case is
solved using regular geometry for 3 given points, but I have also heard
that the problem can be solved using duality theory for any number of
points. Does anyone know where I can learn about such an approach?
Thanks!!!
KH
.
- Follow-Ups:
- Re: Euclidean Steiner Problem w/ duality
- From: Pubkeybreaker
- Re: Euclidean Steiner Problem w/ duality
- Prev by Date: Re: Sets of measure 0 question...
- Next by Date: Re: C[a,b] L1 norm
- Previous by thread: FLTMA: Triangles Associated with Blocks
- Next by thread: Re: Euclidean Steiner Problem w/ duality
- Index(es):