给一堆点,在平面上找一个点(不一定在这些点中),使得该点与所有点的距离和最小。
这是一个计算 Geometric Median 的问题,有个叫做 Weiszfeld’s algorithm 的迭代算法:
y i + 1 = ( ∑ j = 1 m x j ∥ x j − y i ∥ ) / ( ∑ j = 1 m 1 ∥ x j − y i ∥ ) y_{i+1}=\left(\sum_{j=1}^{m} \frac{x_{j}}{\left\|x_{j}-y_{i}\right\|}\right) /\left(\sum_{j=1}^{m} \frac{1}{\left\|x_{j}-y_{i}\right\|}\right) yi+1=(j=1∑m∥xj−yi∥xj)/(j=1∑m∥xj−yi∥1)
直接实现就行,要注意分母接近 0 0 0 的情况。
#define MAXN 55
class Solution {
public:
double k[MAXN];
const double eps=1e-8;
double getMinDistSum(vector<vector<int>>& positions) {
double x1=5,y1=5,x2=0,y2=0;int sz=positions.size();
while(fabs(x1-x2)>eps||fabs(y1-y2)>eps){
x1=x2;y1=y2;double d=0,a=0,b=0;
for(int i=0;i<sz;i++){
double xx=positions[i][0]-x1,yy=positions[i][1]-y1;
double norm=sqrt(xx*xx+yy*yy);
if(fabs(norm)<eps)continue;
k[i]=1/norm;
d+=k[i];a+=k[i]*positions[i][0];b+=k[i]*positions[i][1];
}
x2=a/d;y2=b/d;
}
double res=0;
for(int i=0;i<sz;i++){
double xx=positions[i][0]-x1,yy=positions[i][1]-y1;
res+=sqrt(xx*xx+yy*yy);
}
return res;
}
};
还有很多其他方法,比如 grid search:
#define MAXN 55
class Solution {
public:
const double eps=1e-5;
double dis(double x1,double y1,double x2,double y2){
double xx=x1-x2,yy=y1-y2;
return sqrt(xx*xx+yy*yy);
}
double getMinDistSum(vector<vector<int>>& positions) {
double l=0,r=100,d=0,t=100,x_m,y_m;double res_m=INT_MAX;
int sz=positions.size();
for(double s=10;s>eps;s/=10){
for(double x=l;x<=r;x+=s){
for(double y=d;y<=t;y+=s){
double res=0;
for(int i=0;i<sz;i++)
res+=dis(x,y,positions[i][0],positions[i][1]);
if(res<res_m){
res_m=res;
x_m=x;y_m=y;
}
}
}
l=x_m-s;r=x_m+s;d=y_m-s;t=y_m+s;
}
return res_m;
}
};