计算几何基本板子（待补）

基础点乘叉乘操作：

struct point
{
    int x,y;
    point(){}
    point(int a,int b){x = a;y = b;}

    bool operator== (point b)
    {   return (x == b.x) && (y == b.y);  }
    point operator- (point b)
    {   return point(x-b.x,y-b.y);  }
};

int dcmp(int x)
{   if(x == 0) return 0; else return x < 0 ? -1:1;   }
int Cross(point a , point b)  {return a.x*b.y - a.y*b.x;}   //叉乘
int Dot(point a , point b)    {return a.x*b.x+a.y*b.y;}     //点乘

点在线段上：（不包括端点）

bool isPointOnSegment(point p,point a1,point a2)       //点是否在线段上(无端点)
{
    return dcmp(Cross(a1-p,a2-p)) == 0 && dcmp(Dot(a1-p,a2-p)) < 0;
}

两条线段是否相交

bool SegIntersect(point a1,point a2,point b1,point b2) //两条线是否相交（规范相交，即是只有一个交点而且那个交点不是端点）
{
    int c1 = Cross(a2-a1,b1-a1), c2 = Cross(a2-a1,b2-a1),
        c3 = Cross(b2-b1,a1-b1), c4 = Cross(b2-b1,a2-b1);
    //if(c1 == c2 && c1 == 0) return 1;                //如果有重合部分
    return dcmp(c1)*dcmp(c2)<0 && dcmp(c3)*dcmp(c4)<0;
}

点是否在多边形内部

int isPointInPolygon(point p,int way)                   //转角法判断点是否在多边形内部,不包括边界！在边界上则返回-1
{
    int wn = 0;
    for(int i = 0; i < 3; i++)
    {
        int ai = i+3, bi = i+4;
        if(bi == 6) bi = 3;
        if(way == 1) ai -= 3,bi -= 3;
        point a = poi[ai],b = poi[bi];
        if(isPointOnSegment(p,a,b) || a == p || b == p) return -1;
        int k = dcmp(Cross(b-a,p-a));
        int d1 = dcmp(a.y - p.y);
        int d2 = dcmp(b.y - p.y);
        if(k > 0 && d1 <= 0 && d2 > 0) wn++;
        if(k < 0 && d2 <= 0 && d1 > 0) wn--;
    }
    if(wn != 0) return 1;
    return 0;
}