计算几何简单模板

const double eps = 1e-8;


//点或向量
typedef struct Point
{
	double x, y;
	Point(double a=0, double b=0)
	{
		x = a, y = b;
	}
	const Point operator+(const Point &p)const
	{
		return Point(x + p.x, y + p.y);
	}
	const Point operator-(const Point &p)const
	{
		return Point(x - p.x, y - p.y);
	}
	const Point operator/(double a)const
	{
		return Point(x/a, y/a);
	}
	//点乘
	const double operator*(const Point &p)const
	{
		return x * p.x + y * p.y;
	}
	//×乘
	const double operator^(const Point &p)const
	{
		return x * p.y - y * p.x;
	}
	//长度
	const double len()
	{
		return sqrt(x*x + y * y);
	}
}Point;

//线段
typedef struct Line
{
	Point a, b;
}Line;

//精度比较
int cmp(double x, double y)
{
	if (fabs(x - y) < eps)return 0;
	if (x - y < 0)return -1;
	return 1;
}

//向量夹角[0,pi]
double angle(Point x, Point y)
{
	return acos((x*y) / (x.len()) / y.len());
}

//判断点是否在线段上
bool onsegement(Point p, Line s)
{
	return cmp((s.a - p) ^ (s.b - p), 0) == 0 && cmp((s.a - p)*(s.b - p), 0)<=0;
}

//判断两线段是否相交
bool inter(Line x, Line y)
{
	double c1 = (x.b - x.a) ^ (y.a - x.a), c2 = (x.b - x.a) ^ (y.b - x.a),
		   c3 = (y.b - y.a) ^ (x.a-y.a), c4 = (y.b - y.a) ^ (x.b - y.a);
	if (onsegement(x.a, y) || onsegement(x.b, y) || onsegement(y.a, x) || onsegement(y.b, x))return 1;
	return cmp(c1, 0)*cmp(c2, 0) < 0 && cmp(c3, 0)*cmp(c4, 0) < 0;
}

//求两直线交点
Point getlineinter(Point x1, Point x2, Point y1, Point y2)
{
	x2 = x2 - x1;
	x2 = x2 / x2.len();
	y2 = y2 - y1;
	y2 = y2 / y2.len();
	Point u = x1 - y1;
	double t = (y2^u) / (x2^y2);
	return x1 + Point(x2.x*t, x2.y*t);
}