题目链接:http://poj.org/problem?id=3608
题意:求两个凸包的最短距离。
在之前不知道还要求凸包,就直接求卡壳了,果断wa了;还有在求卡壳时我用角度去比较它们的关系也wa了,可见角度这东西很不靠谱啊。
针对本题,可参考http://cgm.cs.mcgill.ca/~orm/mind2p.html的英文解说。第一次愿意去看英文版的论文,感觉还是很不错的。
题意:求两个凸包的最短距离。
在之前不知道还要求凸包,就直接求卡壳了,果断wa了;还有在求卡壳时我用角度去比较它们的关系也wa了,可见角度这东西很不靠谱啊。
针对本题,可参考http://cgm.cs.mcgill.ca/~orm/mind2p.html的英文解说。第一次愿意去看英文版的论文,感觉还是很不错的。
代码如下:用时:172MS
#include<iostream>
#include<cstdio>
#include<math.h>
#include<algorithm>
#define eps 1e-16
#define inf 1e10
#define maxn 10020
const double PI= acos(-1.0);
struct point{double x,y;};
struct point p[maxn],q[maxn],pp[maxn],qq[maxn];
double pminy,qmaxy;
int ip,iq;
int n,m;
double pang,qang;
double minn;
double distance(point p1,point p2)
{
return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
double min(double a,double b){return a>b? b: a;}
bool cmp(const point &a,const point &b)
{
if(a.y==b.y)return a.x<b.x;
return a.y<b.y;
}
double xmult(point p1,point p2,point p0)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
void Graham(point *points,int &n,point *save)
{
std::sort(points,points+n,cmp);
int i;
if(n<3)
{
for(i=0;i<n;i++)save[i]=points[i];
return ;
}
int top=1;
save[0]=points[0];
save[1]=points[1];
for(i=2;i<n;i++)
{
while(top>0 &&xmult(save[top],points[i],save[top-1])>=0 )top--;
save[++top]=points[i];
}
int mid=top;
for(i=n-2;i>=0;i--)
{
while(top>mid &&xmult(save[top],points[i],save[top-1])>=0 )top--;
save[++top]=points[i];
}
n=top;
}
double judge(point p1 ,point p2,point q1,point q2)
{
point t;
t.x=p2.x-p1.x+q1.x;
t.y=p2.y-p1.y+q1.y;
return xmult(t,q2,q1);
}
point intersection(point p1,point p2,point p3,point p4)
{
point ret=p1;
double t=((p1.x-p3.x)*(p3.y-p4.y)-(p1.y-p3.y)*(p3.x-p4.x))
/((p1.x-p2.x)*(p3.y-p4.y)-(p1.y-p2.y)*(p3.x-p4.x));
ret.x+=(p2.x-p1.x)*t;
ret.y+=(p2.y-p1.y)*t;
return ret;
}
double ptoline(point p1,point l1,point l2)//点到线段的最小距离
{
point p2;
p2.x=p1.x-(l2.y-l1.y);
p2.y=p1.y+(l2.x-l1.x);
if(xmult(l1,p1,p2)*xmult(l2,p1,p2)>eps)
return min(distance(p1,l1),distance(p1,l2));
return distance(p1,intersection(p1,p2,l1,l2));
}
double rc_min()
{
int i;
minn=inf;
p[n]=p[0];
q[m]=q[0];
ip=0,iq=0;
for(i=1;i<n;i++)
if(p[ip].y>p[i].y||p[ip].y==p[i].y&&p[i].x<p[ip].x)
ip=i;
for(i=1;i<m;i++)
if(q[iq].y<q[i].y||q[iq].y==q[i].y&&q[iq].x<q[i].x)
iq=i;
int tp=ip,tq=iq;
do
{
double st=judge(p[ip],p[ip+1],q[iq],q[iq+1]);
if(st>eps)
{
minn=min(minn,ptoline(q[iq],p[ip],p[ip+1]));
ip=(ip+1)%n;
}
else if(st<-eps)
{
minn=min(minn,ptoline(p[ip],q[iq],q[iq+1]));
iq=(iq+1)%m;
}
else
{
minn=min(minn,ptoline(q[iq],p[ip],p[ip+1]));
minn=min(minn,ptoline(p[ip],q[iq],q[iq+1]));
minn=min(minn,ptoline(q[iq+1],p[ip],p[ip+1]));
minn=min(minn,ptoline(p[ip+1],q[iq],q[iq+1]));
ip=(ip+1)%n;
iq=(iq+1)%m;
}
}while(ip!=tp||iq!=tq);
return minn;
}
int main()
{
while(scanf("%d%d",&n,&m),n+m)
{
int i;
for(i=0;i<n;i++)
scanf("%lf%lf",&pp[i].x,&pp[i].y);
Graham(pp,n,p);
for(i=0;i<m;i++)
scanf("%lf%lf",&qq[i].x,&qq[i].y);
Graham(qq,m,q);
printf("%.5lf\n",rc_min());
}
return 0;
}