Intersecting Lines
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 10796 | Accepted: 4811 |
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.
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
题意为每行给你四个点,即两条直线,判断两条直线间的关系,相交需求出交点,共线输出LINE 平行输出NONE。。只需知道两点的直线方程 就可进行求解
#include <iostream> #include <stdlib.h> #include <string.h> #include <stdio.h> #include<math.h> using namespace std; struct node { double x1,y1,x2,y2; } a[4]; int yice(node a,node b) { double s1,s2; s1=b.x1*(a.y2-a.y1) + a.x2*a.y1-a.x1*a.y2 - b.y1*(a.x2-a.x1); //两点间的距离公式(x-a[1].x1)/(a[1].x2-a[1].x1)=(y-a[1].y1)/(a[1].y2-a[1].y1)化简后,带入一个端点 (b.x1,b.y1),得S1 s2=b.x2*(a.y2-a.y1) + a.x2*a.y1-a.x1*a.y2 - b.y2*(a.x2-a.x1); //带入(b.x2,b.y2) 得s2 if(s1<0&& s2>0) return 1; else if(s1>0 && s2<0) //异号存在交点 return 1; else if(s1*s2==0) //乘积为零 说明点在线上 return 2; else return 0; } int main() { int n; scanf("%d",&n); printf("INTERSECTING LINES OUTPUT\n"); while(n--) { scanf("%lf%lf%lf%lf%lf%lf%lf%lf",&a[1].x1,&a[1].y1,&a[1].x2,&a[1].y2,&a[2].x1,&a[2].y1,&a[2].x2,&a[2].y2); if(yice(a[1],a[2])==1 || yice(a[2],a[1])==1) //判断是否有交点,因为是直线,所有只要有一个点在直线的一侧就可 { /* 给了四个点,两个点即可表示为一个两点式方程,联立 (x-a[1].x1)/(a[1].x2-a[1].x1)=(y-a[1].y1)/(a[1].y2-a[1].y1) 和 (x-a[2].x1)/(a[2].x2-a[2].x1) = (y-a[2].y1)/(a[2].y2-a[2].y1) 即可解出交点(x,y)*/ double y=((a[2].x1*a[2].y2-a[2].y1*a[2].x2)*(a[1].y2-a[1].y1) - (a[1].x1*a[1].y2-a[1].y1*a[1].x2)*(a[2].y2-a[2].y1)) /((a[1].x2-a[1].x1)*(a[2].y2-a[2].y1) - (a[2].x2-a[2].x1)*(a[1].y2-a[1].y1)); double x=(y*(a[1].x2-a[1].x1) + (a[1].x1*a[1].y2-a[1].y1*a[1].x2)) / (a[1].y2-a[1].y1); printf("POINT %.2lf %.2lf\n",x,y); } else if(yice(a[1],a[2])==2 && yice(a[2],a[1])==2) //两条直线 共线 ,即为两个点都在另一条直线上 printf("LINE\n"); else printf("NONE\n"); } printf("END OF OUTPUT\n"); return 0; }