题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4741
题意:给出两直线p1,p2,q1,q2。求两直线上离的最近的两个点以及最短距离。
思路:令d1=p2-p1,d2=q2-q1,直线上任意一点可以表示为:
r1(t1)=p1+d1*t1
r2(t2)=p2+d2*t2
#define eps 1e-15
int sgn(double x)
{
if(x>EPS) return 1;
if(x<-EPS) return -1;
return 0;
}
struct point3
{
double x,y,z;
point3(){}
point3(double _x,double _y,double _z)
{
x=_x;
y=_y;
z=_z;
}
void get()
{
RD(x,y); RD(z);
}
point3 operator+(point3 a)
{
return point3(x+a.x,y+a.y,z+a.z);
}
point3 operator-(point3 a)
{
return point3(x-a.x,y-a.y,z-a.z);
}
point3 operator*(point3 a)
{
return point3(y*a.z-z*a.y,z*a.x-x*a.z,x*a.y-y*a.x);
}
point3 operator*(double t)
{
return point3(x*t,y*t,z*t);
}
double operator^(point3 a)
{
return x*a.x+y*a.y+z*a.z;
}
point3 operator/(double t)
{
return point3(x/t,y/t,z/t);
}
double len()
{
return sqrt(x*x+y*y+z*z);
}
};
double len(point3 a)
{
return a.len();
}
point3 p,q,a,b,c,d;
int main()
{
rush()
{
a.get();
b.get();
c.get();
d.get();
point3 p1=a,p2=c;
point3 d1=b-a,d2=d-c;
double t1=(((p2-p1)*d2)^(d1*d2))/(sqr(len(d1*d2)));
double t2=(((p2-p1)*d1)^(d1*d2))/(sqr(len(d1*d2)));
p=p1+d1*t1;
q=p2+d2*t2;
double ans=len(p-q);
PR(ans);
printf("%.6lf %.6lf %.6lf %.6lf %.6lf %.6lf\n",p.x,p.y,p.z,q.x,q.y,q.z);
}
}