This question is purely for curiosity's sake:

Suppose I have a collection of points on a 2D plane {P1, P2,..., Pn}

How would I find the point X such that the sum of the magnitude of all vectors (||PnX||) is the smallest possible.

- Jun 1st 2010, 12:12 PMBigCPoint that is at the shortest total distance from multiple points
This question is purely for curiosity's sake:

Suppose I have a collection of points on a 2D plane {P1, P2,..., Pn}

How would I find the point X such that the sum of the magnitude of all vectors (||__PnX__||) is the smallest possible. - Jun 1st 2010, 12:34 PMdwsmith
- Jun 1st 2010, 01:05 PMBigC
- Jun 1st 2010, 01:44 PMdwsmith
The line of best fit uses least-squares. If your points are in a linear fashion, you can come up with a line, y=mx+b, where the magnitude is minimized. The line you achieve will be the line of best fit. Of course, we could do this for circles, quadratics, polynomials, etc.

- Jun 1st 2010, 01:59 PMBigC
- Jun 1st 2010, 02:07 PMdwsmith