《训练指南》大白 二维几何基础 基本公式（模板）

《训练指南》大白 二维几何基础 基本公式（模板）

#include<bits/stdc++.h>
using namespace std;
struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}///构造函数
};
typedef Point Vector ;
///向量+向量=向量，点+向量=点
Vector operator + (Vector A,Vector B){return Vector(A.x+B.x,A.y+B.y);}
///点-点等于向量
Vector operator - (Point A,Point B){return Vector(A.x-B.x,A.y-B.y);}
///向量*数 = 向量
Vector operator * (Vector A,double p){return Vector(A.x*p,A.y*p);}
///向量/数 = 向量
Vector operator / (Vector A,double p){return Vector(A.x/p,A.y/p);}

///判断小于关系，先判断x后判断y
bool operator < (const Point& a,const Point& b){
    return a.x<b.x||(a.x==b.x&&a.y<b.y) ;
}

///判断一个数与0的关系
const double eps = 1e-10 ;
int dcmp(double x){
    if(fabs(x)<eps)return 0;///精度范围内认为等于0
    else return x<0?-1:1 ;///小于0返回-1，大于0返回1
}

///判断两个向量/点是否相等
bool operator == (const Point& a,const Point& b){
    return dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)==0 ;
}

///点积
double Dot(Vector A,Vector B){return A.x*B.x + A.y*B.y ;}
///向量长度
double Length(Vector A){return sqrt(Dot(A,A));}
///两向量夹角
double Angle(Vector A,Vector B){return acos(Dot(A,B)/Length(A)/Length(B)) ;}
///叉积
double Cross(Vector A,Vector B){return A.x*B.y - A.y*B.x ;}
///what
double Area2(Point A,Point B,Point C){return Cross(B-A,C-A) ;}
///向量旋转，rad为逆时针旋转的角度
Vector Rotate(Vector A,double rad){return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
///单位法向量，左转90度，长度单位化
Vector Normal(Vector A){
    double L = Length(A) ;
    return Vector(-A.y/L,A.x/L) ;
}
///获得两条直线的交点,注意v，w不共线，即有唯一交点
Point GetLineIntersection(Point P,Vector v,Point Q,Vector w){
    Vector u = P-Q ;
    double t = Cross(w,u)/Cross(v,w) ;
    return P+v*t ;
}
///获得点到直线的距离，A,B是直线上的两个点
double DistanceToLine(Point P,Point A,Point B){
    Vector v1 = B-A ,v2 = P-A ;
    return fabs(Cross(v1,v2))/Length(v1) ;
}
///点到线段的距离，要求三点不共线
double DistanceToSegment(Point P,Point A,Point B){
    if(A==B)return Length(P-A) ;
    Vector v1 = B-A ,v2 =P-A,v3 = P-B ;
    if(dcmp(Dot(v1,v2))<0)return Length(v2) ;
    else if(dcmp(Dot(v1,v3))>0)return Length(v3) ;
    else return fabs(Cross(v1,v2))/Length(v1) ;
}
///点在直线上的投影,三点不共线
Point GetLineProjection(Point P,Point A,Point B){
    Vector v = B-A ;
    return A+v*(Dot(v,P-A)/Dot(v,v)) ;
}
///线段相交判定,规范相交，即两个线段恰好有一个公共点，且不再任意一条线段的端点上
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2){
    double c1 = Cross(a2-a1,b1-a1) ;
    double c2 = Cross(a2-a1,b2-a1) ;
    double c3 = Cross(b2-b1,a1-b1) ;
    double c4 = Cross(b2-b1,a2-b1) ;
    return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0 ;
}
///判断一个点是否在线段上
bool OnSegment(Point p,Point a1,Point a2){return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0 ;}

///多边形的有向面积
double PolygonArea(Point* 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 ;
}

///以上为可以在主函数调用的函数