计算几何模版

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;
const double eps = 1e-10;
const int maxn = 310;
int n,ca,c,e;
struct Tpoint {
    double x, y;
    Tpoint(double x = 0, double y = 0) : x(x) , y(y) { }
};
Tpoint operator + (Tpoint A, Tpoint B) { return Tpoint(A.x+B.x, A.y+B.y); }
Tpoint operator - (Tpoint A, Tpoint B) { return Tpoint(A.x-B.x, A.y-B.y); }
Tpoint operator * (Tpoint A, double p) { return Tpoint(A.x*p, A.y*p); }
Tpoint operator / (Tpoint A, double p) { return Tpoint(A.x/p, A.y/p); }
bool operator < (const Tpoint& a, const Tpoint& b) {
    return a.x < b.x || (a.x == b.x && a.y < b.y);
}
int sign(double x) {
    if(fabs(x) < eps) return 0; else return x < 0 ? -1 : 1;
}
bool operator == (const Tpoint& a, const Tpoint& b) {
    return sign(a.x - b.x) == 0 && sign(a.y - b.y) == 0;
}
double Dot(Tpoint A, Tpoint B) { return A.x*B.x + A.y*B.y; }
double Length(Tpoint A) { return sqrt(Dot(A, A)); }
double Angle(Tpoint A, Tpoint B) { return acos(Dot(A, B) / Length(A) / Length(B)); }
double Cross(Tpoint A, Tpoint B) { return A.x*B.y - A.y*B.x; }
double Area2(Tpoint A, Tpoint B, Tpoint C) { return Cross(B-A, C-A); }

Tpoint Rotate(Tpoint A, double rad) {
    return Tpoint(A.x*cos(rad) - A.y*sin(rad), A.x*sin(rad)+A.y*cos(rad) );
}
Tpoint Normal(Tpoint A) {
    double L = Length(A);
    return Tpoint(-A.y/L, A.x/L);
}

Tpoint GetLineIntersection(Tpoint P, Tpoint v, Tpoint Q, Tpoint w) {
    Tpoint u = P - Q;
    double t = Cross(w, u) / Cross(v, w);
    return P + v * t;
}

double DistanceToLine(Tpoint P, Tpoint A, Tpoint B) {
    Tpoint v1 = B-A, v2 = P - A;
    return fabs(Cross(v1,v2) / Length(v1));
}

double DistanceToSegment(Tpoint P, Tpoint A, Tpoint B) {
    if(A==B) return Length(P-A);
    Tpoint v1 = B - A, v2 = P - A, v3 = P - B;
    if(sign(Dot(v1, v2)) < 0) return Length(v2);
    else if(sign(Dot(v1, v3)) > 0) return Length(v3);
    else return fabs(Cross(v1, v2)) / Length(v1);
}

Tpoint GetLineProjection(Tpoint P, Tpoint A, Tpoint B) {
    Tpoint v = B - A;
    return A + v * ( Dot(v, P-A) / Dot(v, v) );
}

bool SegmentProperIntersection(Tpoint a1, Tpoint a2, Tpoint b1, Tpoint b2){
    double c1 = Cross(a2 - a1, b1 - a1), c2 = Cross(a2 - a1, b2 - a1),
            c3 = Cross(b2 - b1, a1 - b1), c4 = Cross(b2 - b1, a2 - b1);
    return sign(c1) * sign(c2) < 0 && sign(c3) * sign(c4) < 0;
}

bool OnSegment(Tpoint p, Tpoint a1, Tpoint a2){//点在中间，边一分为二
    return sign(Cross(a1 - p, a2 - p)) == 0 && sign(Dot(a1 - p, a2 - p)) < 0;
}

double ConvexPolygonArea(Tpoint* p, int n) {
    double area = 0;
    for(int i = 1; i < n-1; i++)
        area += Cross(p[i] - p[0], p[i + 1] - p[0]);
    return area / 2;
}