poj 1269 判直线共线,平行,求交点
2016-08-23 09:55
447 查看
Intersecting Lines
Description
We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect in a line because they are on top of one another (i.e. they
are the same line), 3) intersect in a point. In this problem you will use your algebraic knowledge to create a program that determines how and where two lines intersect.
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.
Input
The first line contains an integer N between 1 and 10 describing how many pairs of lines are represented. The next N lines will each contain eight integers. These integers represent the coordinates of four points on the plane in the order x1y1x2y2x3y3x4y4.
Thus each of these input lines represents two lines on the plane: the line through (x1,y1) and (x2,y2) and the line through (x3,y3) and (x4,y4). The point (x1,y1) is always distinct from (x2,y2). Likewise with (x3,y3) and (x4,y4).
Output
There should be N+2 lines of output. The first line of output should read INTERSECTING LINES OUTPUT. There will then be one line of output for each pair of planar lines represented by a line of input, describing how the lines intersect: none, line, or point.
If the intersection is a point then your program should output the x and y coordinates of the point, correct to two decimal places. The final line of output should read "END OF OUTPUT".
Sample Input
Sample Output
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct point
{
int x,y;
}p1,p2,p3,p4;
struct line
{
int a,b,c;
};
int judge_line(int x1,int y1,int x2,int y2)
{
//向量 (x1,y1,) (x2,y2)
return x1*y2-y1*x2;//若是为0就是平行
}
line lineform(int x1,int y1,int x2,int y2)
{
//计算ax + by + c = 0
line temp;
temp.a=y2-y1;
temp.b=x1-x2;
temp.c=x2*y1-x1*y2;
return temp;
}
double x,y;
void lineintersect(line l1,line l2)
{
double d=l1.a*l2.b-l2.a*l1.b;
x=(l2.c*l1.b-l1.c*l2.b)/d;
y=(l2.a*l1.c-l1.a*l2.c)/d;
}
int main()
{
int T;
//freopen("in.txt","r",stdin);
scanf("%d",&T);
puts("INTERSECTING LINES OUTPUT");
while(T--)
{
scanf("%d%d%d%d%d%d%d%d",&p1.x,&p1.y,&p2.x,&p2.y,&p3.x,&p3.y,&p4.x,&p4.y);
if(judge_line(p2.x-p1.x,p2.y-p1.y,p3.x-p1.x,p3.y-p1.y)==0
&&judge_line(p2.x-p1.x,p2.y-p1.y,p4.x-p1.x,p4.y-p1.y)==0)
puts("LINE");//共线
else if(judge_line(p2.x-p1.x,p2.y-p1.y,p4.x-p3.x,p4.y-p3.y)==0)
puts("NONE");//平行
else{
line l1=lineform(p1.x,p1.y,p2.x,p2.y);
line l2=lineform(p3.x,p3.y,p4.x,p4.y);
lineintersect(l1,l2);
printf("POINT %0.2lf %0.2lf\n",x,y);
}
}
puts("END OF OUTPUT");
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 14636 | Accepted: 6461 |
We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, 2) intersect in a line because they are on top of one another (i.e. they
are the same line), 3) intersect in a point. In this problem you will use your algebraic knowledge to create a program that determines how and where two lines intersect.
Your program will repeatedly read in four points that define two lines in the x-y plane and determine how and where the lines intersect. All numbers required by this problem will be reasonable, say between -1000 and 1000.
Input
The first line contains an integer N between 1 and 10 describing how many pairs of lines are represented. The next N lines will each contain eight integers. These integers represent the coordinates of four points on the plane in the order x1y1x2y2x3y3x4y4.
Thus each of these input lines represents two lines on the plane: the line through (x1,y1) and (x2,y2) and the line through (x3,y3) and (x4,y4). The point (x1,y1) is always distinct from (x2,y2). Likewise with (x3,y3) and (x4,y4).
Output
There should be N+2 lines of output. The first line of output should read INTERSECTING LINES OUTPUT. There will then be one line of output for each pair of planar lines represented by a line of input, describing how the lines intersect: none, line, or point.
If the intersection is a point then your program should output the x and y coordinates of the point, correct to two decimal places. The final line of output should read "END OF OUTPUT".
Sample Input
5 0 0 4 4 0 4 4 0 5 0 7 6 1 0 2 3 5 0 7 6 3 -6 4 -3 2 0 2 27 1 5 18 5 0 3 4 0 1 2 2 5
Sample Output
INTERSECTING LINES OUTPUT POINT 2.00 2.00 NONE LINE POINT 2.00 5.00 POINT 1.07 2.20 END OF OUTPUT
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct point
{
int x,y;
}p1,p2,p3,p4;
struct line
{
int a,b,c;
};
int judge_line(int x1,int y1,int x2,int y2)
{
//向量 (x1,y1,) (x2,y2)
return x1*y2-y1*x2;//若是为0就是平行
}
line lineform(int x1,int y1,int x2,int y2)
{
//计算ax + by + c = 0
line temp;
temp.a=y2-y1;
temp.b=x1-x2;
temp.c=x2*y1-x1*y2;
return temp;
}
double x,y;
void lineintersect(line l1,line l2)
{
double d=l1.a*l2.b-l2.a*l1.b;
x=(l2.c*l1.b-l1.c*l2.b)/d;
y=(l2.a*l1.c-l1.a*l2.c)/d;
}
int main()
{
int T;
//freopen("in.txt","r",stdin);
scanf("%d",&T);
puts("INTERSECTING LINES OUTPUT");
while(T--)
{
scanf("%d%d%d%d%d%d%d%d",&p1.x,&p1.y,&p2.x,&p2.y,&p3.x,&p3.y,&p4.x,&p4.y);
if(judge_line(p2.x-p1.x,p2.y-p1.y,p3.x-p1.x,p3.y-p1.y)==0
&&judge_line(p2.x-p1.x,p2.y-p1.y,p4.x-p1.x,p4.y-p1.y)==0)
puts("LINE");//共线
else if(judge_line(p2.x-p1.x,p2.y-p1.y,p4.x-p3.x,p4.y-p3.y)==0)
puts("NONE");//平行
else{
line l1=lineform(p1.x,p1.y,p2.x,p2.y);
line l2=lineform(p3.x,p3.y,p4.x,p4.y);
lineintersect(l1,l2);
printf("POINT %0.2lf %0.2lf\n",x,y);
}
}
puts("END OF OUTPUT");
return 0;
}
相关文章推荐
- POJ 1269 Intersecting Lines(直线相交?平行?重合?,求交点)
- POJ 1269 Intersecting Lines 判断直线关系(相交(求交点),重合,平行)
- poj 1269 Intersecting Lines 求直线交点 判断直线平行共线
- POJ 1269 Intersecting Lines 判断直线关系(相交(求交点),重合,平行)
- POJ 1269 Intersecting Lines(计算几何 直线交点 点在直线上 直线平行)
- POJ 1269 判断直线的关系:相交,平行,重合
- poj 1269 判断两直线的关系并求交点
- Poj 1269 Intersecting Lines (直线交点)
- poj 1269 Intersecting Lines(判相交交点与平行)
- POJ_1269_Intersecting Lines_求直线交点
- poj 1269 知识点:直线相交判断,求相交交点
- [poj] 1269 [zoj] 1280 Interesting Lines || 求两直线交点
- POJ 1269 Intersecting Lines(直线相交判断,求交点)
- Intersecting Lines--POJ1269(判断两条直线的关系 && 求两条直线的交点)
- poj 1269 Intersecting Lines(判断两直线关系,并求交点坐标)
- poj 1269Intersecting Lines (直线相交判断,求相交交点)
- POJ 1269 Intersecting Lines(直线相交判断,求交点)
- poj 1269 判断直线相交,并求交点
- poj 1269 Intersecting Lines(直线相交判断,求相交交点)
- poj 1269(两条直线交点)