l***i
发帖数: 1309 | 1 Given n points on a 2D plane, (x1, y1), ... (xn,yn)
Find the point among the n points that minimizes sum_(x_i - x_k), i=1,...,n,
for k=1,..,n. | m********0
发帖数: 2717 | | H*M
发帖数: 1268 | 3 why is this a 2D problem? why is this related to y??
or typo?
n,
【在 l***i 的大作中提到】
: Given n points on a 2D plane, (x1, y1), ... (xn,yn)
: Find the point among the n points that minimizes sum_(x_i - x_k), i=1,...,n,
: for k=1,..,n.
| m********0
发帖数: 2717 | 4 I guess it's minimization on
sum(|vi- vj|) distance
【在 H*M 的大作中提到】
: why is this a 2D problem? why is this related to y??
: or typo?
:
: n,
| g*******y
发帖数: 1930 | 5 it can also be minimization on sum(|x-xi|+|y-yi|) | l***i
发帖数: 1309 | 6 Sorry it is typo.
The problem is find one point (x,y) among (x1,y1), ... (xn,yn) such that sum
_i=1^n |x-xi| + |y-yi| is minimized.
geniusxsy is correct. |
|
