[AIZU ONLINE JUDGE] 计算几何 CGL_2_B

Intersection

For given two segments s1 and s2, print "1" if they are intersect, "0" otherwise.

s1 is formed by end points p0 and p1, and s2 is formed by end points p2 and p3.

Input

The entire input looks like:

q (the number of queries)
1st query
2nd query
...
qth query

Each query consists of integer coordinates of end points of s1 and s2 in the following format:

xp0 yp0 xp1 yp1 xp2 yp2 xp3 yp3

Output

For each query, print "1" or "0".

Constraints

• 1 ≤ q ≤ 1000
• -10000 ≤ xpi, ypi ≤ 10000
• p0 ≠ p1 and p2 ≠ p3.

Sample Input 1

3
0 0 3 0 1 1 2 -1
0 0 3 0 3 1 3 -1
0 0 3 0 3 -2 5 0

Sample Output 1

1
1
0

题目大意：

判断两条线段是否相交

题解：

模板题，主要是函数Segment_poper_intersection的书写 需要注意很多细节

这道题中的线段相交是包括端点的

#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

const double eps = 1e-8;

int sign(double x)
{
	if (fabs(x) < eps) return 0;
	if (x > 0)return 1;
	return -1;
}
int dcmp(double x)
{
	if (fabs(x) < eps) return 0;
	if (x > 0)return 1;
	return -1;
}

struct Point
{
	double x, y;

	Point(double x = 0, double y = 0) :x(x), y(y) { }

	Point operator- (Point& t)
	{
		return Point(x - t.x, y - t.y);
	}

	friend double operator ^ (const Point& a, const Point& b)
	{
		return a.x * b.y - a.y * b.x;
	}

};

typedef Point Vector;

struct Line
{
	Point p;
	Vector v;

	Line(Point p, Vector v) : p(p), v(v) { }
};

int m;

double dot(Vector A, Vector B)
{
	return A.x * B.x + A.y * B.y;
}

double cross(Vector A, Vector B)
{
	return A.x * B.y - A.y * B.x;
}

bool OnSegment(Point p, Point a1, Point a2)
{
	return sign(cross(a1 - p, a2 - p)) == 0 && sign(dot(a1 - p, a2 - p)) <= 0;
}

bool Segment_proper_intersection(Point a1, Point a2, Point b1, Point b2)
{
	double c1 = cross(a2 - a1, b1 - a1), c2 = cross(a2 - a1, b2 - a1);
	double c3 = cross(b2 - b1, a1 - b1), c4 = cross(b2 - b1, a2 - b1);

	//cout << c1 << ' ' << c2 << " " << c3 << " " << c4 << endl;

	//if判断控制是否允许线段在端点处相交，根据需要添加
	if (!sign(c1) || !sign(c2) || !sign(c3) || !sign(c4)) {
		bool f1 = OnSegment(b1, a1, a2);
		bool f2 = OnSegment(b2, a1, a2);
		bool f3 = OnSegment(a1, b1, b2);
		bool f4 = OnSegment(a2, b1, b2);

		//cout << f1 << ' ' << f2 << ' ' << f3 << ' ' << f4 << endl;

		bool f = (f1 | f2 | f3 | f4);
		return f;
	}
	return (sign(c1) * sign(c2) < 0 && sign(c3) * sign(c4) < 0);

}

int main()
{
	cin >> m;
	while (m--)
	{
		Point A, B, C, D;

		cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y >> D.x >> D.y;

		if (Segment_proper_intersection(A, B, C, D)) cout << 1 << endl;
		else cout << 0 << endl;
	}

	return 0;
}