poj 1269 Intersecting Lines (计算几何)

Intersecting Lines

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 12863		Accepted: 5712

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

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

 给出n对直线。。。问每对直线的位置关系（平行，重合，相交，相交的话要求出交点）

嗯。

/*************************************************************************
    > File Name: a.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年11月06日 星期五 09时48分39秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
#define fst first              
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ms(a,x) memset(a,x,sizeof(a))
using namespace std;
const int dx4[4]={1,0,0,-1};
const int dy4[4]={0,-1,1,0};
typedef long long LL;
#define sec second
const int inf = 0x3f3f3f3f;
const double eps=1E-8;
int n;

int dblcmp( double d)
{
    return d<-eps?-1:d>eps;
}

struct  point
{
    double x,y;
    point(){}
    point(double _x,double _y):
    x(_x),y(_y){};
    void input() 
    {
    scanf("%lf%lf",&x,&y);
    }
    void output()
    {
    printf("%.2f %.2f
",x,y);
    }
    point sub(point p)
    {
    return point(x-p.x,y-p.y);
    }
    double det(point p)
    {
    return x*p.y-y*p.x;
    }

};

struct line
{
    point a,b;
    line(){}
    void input()
    {
    a.input();
    b.input();
    }


    
    int relation(point p)
    {
    int c = dblcmp(p.sub(a).det(b.sub(a)));
    if (c<0) return 1;
    if (c>0) return 2;
    return 3;
    }
    bool parallel(line v)
    {
    return dblcmp(b.sub(a).det(v.b.sub(v.a)))==0;
    }
    //0平行
    //1重合
    //2相交
    int linecrossline(line v)
    {
    if ((*this).parallel(v))
    {
        return v.relation(a)==3;
    }
    return 2;
    }

    point crosspoint(line v)
    {
    double a1 = v.b.sub(v.a).det(a.sub(v.a));
    double a2 = v.b.sub(v.a).det(b.sub(v.a));
    return point((a.x*a2-b.x*a1)/(a2-a1),(a.y*a2-b.y*a1)/(a2-a1));
    }
}li[15][3];
int main()
{
  #ifndef  ONLINE_JUDGE 
   freopen("in.txt","r",stdin);
  #endif
    scanf("%d",&n);
    for ( int i = 1 ; i <= n ; i++)
    {
    li[i][1].input();
    li[i][2].input();
    }

    puts("INTERSECTING LINES OUTPUT");
    for ( int i = 1 ; i <=  n ; i++)
    {
    int tmp = li[i][1].linecrossline(li[i][2]);
//    cout<<"tmp:"<<tmp<<endl;
    if (tmp==0)
    {
        puts("NONE");
    }
    if (tmp==1)
    {
        puts("LINE");
    }
    if (tmp==2)
    {
        printf("POINT ");
        li[i][1].crosspoint(li[i][2]).output();
    }
    }
    puts("END OF OUTPUT");



  
   
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}