几何模板总结（一）：二维基础

实数比较

const double eps=1e-8;
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1:1;
}

点和向量的定义

struct point
{
    double x,y;
    point(double x=0,double y=0):x(x),y(y){}
};
point operator+(point a,point b){return point(a.x+b.x,a.y+b.y);}
point operator-(point a,point b){return point(a.x-b.x,a.y-b.y);}
point operator*(point a,double p){return point(a.x*p,a.y*p);}
point operator/(point a,double p){return point(a.x/p,a.y/p);}
bool operator <(const point& a,const point& b)
{
    return dcmp(a.x-b.x)<0 || (dcmp(a.x-b.x)==0&&dcmp(a.y-b.y)<0);
}
bool operator==(point a,point b)
{
    return dcmp(a.x-b.x)==0 && dcmp(a.y-b.y)==0;
}

二维几何基本运算

点积：dot(u,v)=|u|*|v|*cos<u,v>

double dot(point a,point b){return a.x*b.x+a.y*b.y;}    //点积
double length(point a){return sqrt(dot(a,a));}          //向量的长度
double angle(point a,point b){return acos(dot(a,b)/length(a)/length(b));}   //两向量的夹角

叉积：cross(u,v)为两向量组成的三角形的有向面积的2倍

double cross(point a,point b){return a.x*b.y-a.y*b.x;}          //叉积
double area2(point a,point b,point c){return cross(b-a,c-a);}   //三角形面积的2倍

向量旋转

point rotate(point a,double rad)
{
    return point(a.x*cos(rad)-a.y*sin(rad),a.x*sin(rad)+a.y*cos(rad));
}

计算向量的单位法线

point normal(point a)
{
    double L=length(a);
    return point(-a.y/L,a.x/L);
}

求两直线交点，需保证给出的两直线不共线

//p，q分别为两直线上的一点，v,w分别为两直线的方向向量
point getlineinter(point p,point v,point q,point w)
{
    point u=p-q;
    double t=cross(w,u)/cross(v,w);
    return p+v*t;
}

点到直线的距离

double distoline(point p,point a,point b)
{
    point v1=b-a,v2=p-a;
    return fabs(cross(v1,v2))/length(v1);
}

点到线段的距离

double distoseg(point p,point a,point b)
{
    if(a==b) return length(p-a);
    point 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 getpro(point p,point a,point b)
{
    point v=b-a;
    return a+v*(dot(v,p-a)/dot(v,v));
}

判断线段规范相交

bool segproperint(point a1,point a2,point b1,point 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 dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0;
}

判断点是否在线段上（不含端点）

bool onseg(point p,point a1,point a2)
{
    return dcmp(cross(a1-p,a2-p))==0 && dcmp(dot(a1-p,a2-p))<0;
}

求多边形的有向面积（可能为负）

double polyarea(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;
}