链接:https://cn.vjudge.net/problem/POJ-1269
题意:判断两条直线是重合、平行或相交,相交输出交点。
思路:重合、平行的话,两直线上的向量叉积为0,重合的时候,找一个直线的端点和另一个直线的两端点形成的向量的叉积也为0。相交怎么求交点呢?好像用到什么数学定理,和面积相关,直接用就好了。
#include <cstdio>
#include <iostream>
#include <cmath>
#define ll long long
using namespace std;
const double eps = 1e-8;
int sgn(double x)
{
if(fabs(x)<eps) return 0;
else if(x<0) return -1;
else return 1;
}
struct Point
{
double x,y;
Point(){}
Point(double x,double y):x(x),y(y){}
Point operator -(const Point& b)const//相减
{
return Point(x-b.x,y-b.y);
}
double operator ^(const Point& b)const//叉乘
{
return x*b.y-y*b.x;
}
double operator *(const Point& b)const//点乘
{
return x*b.x+y*b.y;
}
};
struct Line
{
Point s,e;
Line(){}
Line(Point ss,Point ee)
{
s=ss,e=ee;
}
pair<Point,int> operator &(const Line& b)const//两直线相对关系
{
Point res=s;
if(sgn((s-e)^(b.s-b.e))==0)
{
if(sgn((b.s-s)^(b.e-s))==0)//两直线重合
return make_pair(res,0);
else return make_pair(res,1);//两直线平行
}
double t=((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));
res.x+=(e.x-s.x)*t;
res.y+=(e.y-s.y)*t;
return make_pair(res,2);//两直线相交
}
}l1,l2;
int n;
pair<Point,int> ans;
double x1,x2,x3,x4,y1,y2,y3,y4;
int main(void)
{
scanf("%d",&n);
puts("INTERSECTING LINES OUTPUT");
for(int i=1;i<=n;i++)
{
scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4);
l1=Line(Point(x1,y1),Point(x2,y2));
l2=Line(Point(x3,y3),Point(x4,y4));
ans=l1&l2;
if(!ans.second)
puts("LINE");
else if(ans.second==1)
puts("NONE");
else
printf("POINT %.2f %.2f\n",ans.first.x,ans.first.y);
}
puts("END OF OUTPUT");
return 0;
}