Intersecting Lines

总时间限制: 

1000ms

 

内存限制: 

65536kB

描述

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.

输入

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).

输出

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".

【题解】

计算几何模板题。关键是把和interset()函数相关的计算模板背下。

【代码】

#include <iostream>
#include <cstdlib>
#include <cmath>
using namespace std;
#define CPoint CVector
#define PI acos(-1)
#define INF 1e20
#define EPS 1e-12

struct CVector
{
    double x, y;
    CVector(double _x, double _y) :
        x(_x), y(_y) {}
    CVector() :x(INF), y(INF) {}
};

struct CLine
{
    CPoint a, b;
    CLine(CPoint _a, CPoint _b) {
        a = _a;
        b = _b;
    }
};

bool isZero(double x) {
    return -EPS < x && x < EPS;
}

CVector operator + (CVector p, CVector q) {
    return CVector(p.x + q.x, p.y + q.y);
}

CVector operator - (CVector p, CVector q){
    return CVector(p.x - q.x, p.y - q.y);
}

double operator ^(CVector p, CVector q) {
    return p.x * q.y - p.y * q.x;
}

double area(CVector p, CVector q) {
    return (p ^ q) / 2;
}

double operator *(CVector p, CVector q) {
    return p.x*q.x + p.y*q.y;
}

CVector operator *(double k, CVector p) {
    return CVector(k*p.x, k*p.y);
}

double length(CVector p) {
    return sqrt(p * p);
}

double dist(CPoint p, CLine l) {
    return fabs((p - l.a) ^ (l.b - l.a)) / length(l.b - l.a);
}

CPoint interset(CLine l, CLine m, string &msg) {
    double x = area(m.a - l.a, l.b - l.a);
    double y = area(l.b - l.a, m.b - l.a);
    if (isZero(x + y)) {
        if (isZero(dist(l.a, m)))
            msg = "LINE";
        else msg = "NONE";
        return CPoint();
    }
    msg = "POINT";
    return m.a + (x / (x + y)) * (m.b - m.a);
}

int main()
{
    int N = 0;
    cin >> N;
    printf("INTERSECTING LINES OUTPUT
");
    while (N--) {
        int x1, y1, x2, y2, x3, y3, x4, y4;
        string msg;
        cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
        CLine l = CLine(CPoint(x1, y1), CPoint(x2, y2));
        CLine m = CLine(CPoint(x3, y3), CPoint(x4, y4));
        CPoint p = interset(l, m, msg);
        if (p.x == INF) printf("%s
", msg.c_str());
        else printf("%s %.2f %.2f
", msg.c_str(), p.x, p.y);
    }
    printf("END OF OUTPUT
");
    //system("pause");
    return 0;
}