LA-3263-计算几何，欧拉定理

题目大意：有n个点组成的一笔画，问这个图形把平面分成了几个部分；

题目解析：先把那些直线相交得出的点算出来得出点数，再把 边数算出来，有一个点在原来的线段上并且不与端点重合边数就加一，因为一条线段变成了两条线段，最后根据欧拉定理f=e+2-v算出面数；

AC代码：

#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 - (Vector A,Vector 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);}
bool operator < (const Point& a,const Point& b)
{
    return a.x<b.x||(a.x==b.x&&a.y<b.y);
}
const double eps=1e-10;
int dcmp(double x)
{
    if(fabs(x)<eps) return 0;
    else return x<0?-1: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;}                    //点的叉积
double Area2(Point A,Point B,Point C){return Cross(B-A,C-A);}                    //三点构成的三角形面积的两倍
Vector Rotate(Vector A,double rad)    {return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}     //向量逆时针旋转
Vector Normal(Vector A)                                                            //向量的法线
{
    double L = Length(A);
    return Vector(-A.y/L,A.x/L);
}

//定义直线P+tv，计算两直线的交点，前提是两直线不平行
Point GetLineIntersection(Point P,Point v,Point Q,Point w)
{
    Vector u=P-Q;
    double t=Cross(w,u)/Cross(v,w);
    return P+v*t;
}
 //点到直线的距离
double DistanceToLine(Point P,Point A,Point B)
{
    Vector v1=B-A,v2=P-A;
    return fabs(Cross(v1,v2))/Length(v1);
}
 //点到线段的距离
double DistanceToSegement(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),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 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;
 }

const int maxn=310;
Point p[maxn],v[maxn*maxn];
int main()
{
    int cas=1,n;
    while(scanf("%d",&n)!=EOF&&n)
    {
        for(int i=0;i<n;i++)
        {
            scanf("%lf%lf",&p[i].x,&p[i].y);
            v[i]=p[i];
        }
        int c=n,e=n-1;
        for(int i=0;i<n-1;i++)
        {
            for(int j=i+1;j<n-1;j++)
            {
                if(SegmentProperIntersection(p[i],p[i+1],p[j],p[j+1]))
                {
                    v[c++]=GetLineIntersection(p[i],p[i+1]-p[i],p[j],p[j+1]-p[j]);
                }
            }
        }
        sort(v,v+c);
        c=unique(v,v+c)-v;
        for(int i=0;i<c;i++)
        {
            for(int j=0;j<n-1;j++)
            {
                if(OnSegment(v[i],p[j],p[j+1]))
                    e++;
            }
        }
        printf("Case %d: There are %d pieces.\n",cas++,e+2-c);
    }
    return 0;
}