题目:
题意:
顺时针给一个多边形,求合格核点的面积(半平面交面积)
题解:
半平面交面积啦,这里采用一种
O(nlogn)
的半平面交吧
一点知识储备
极角:从x正半轴旋转到向量v所需要的角(弧度)
按照极角排序的方法: ang=atan2(v.y,v.x) (v即方向向量,ta的左边就是对应的半平面)
下面代码咯
bool Onleft(Line L,po p){return dcmp(cj(L.v,p-L.p))>0;}
//p在L的左边
void halfp()
{
sort(L+1,L+n+1,cmp);
head=tail=1; q[1]=L[1];
for (int i=2;i<=n;i++)
{
while (head<tail && !Onleft(L[i],p[tail-1])) --tail;
while (head<tail && !Onleft(L[i],p[head])) ++head;
q[++tail]=L[i];
if (dcmp(cj(q[tail].v,q[tail-1].v))==0)//两向量平行且同向
{
tail--;
if (Onleft(q[tail],L[i].p)) q[tail]=L[i];//取内侧的一个
}
if (head<tail) p[tail-1]=jd(q[tail],q[tail-1]);
//p[i]为q[i]和q[i+1]的交点
}
while (head<tail && !Onleft(q[head],p[tail-1])) --tail;
if (tail-head<=1) return 0;
p[tail]=jd(q[tail],q[head]);
int m=0;
for (int i=head;i<=tail;i++) poly[++m]=p[i];
}
那么求出交点之后肯定是个凸包啊,三角剖分求面积就行了,1A啦哈哈哈
代码:
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;
const int N=1505;
const double INF=1e18;
const double eps=1e-9;
int dcmp(double x)
{
if (x<=eps && x>=-eps) return 0;
return (x>0)?1:-1;
}
struct po
{
double x,y;
po (double X=0,double Y=0){x=X;y=Y;}
}p[N],d[N],poly[N];
struct Line
{
po x,v;double ang;
Line (po X=po(0,0),po V=po(0,0)){x=X; v=V; ang=atan2(v.y,v.x);}
}L[N],q[N];
int m,head,tail,n;
po operator +(po x,po y){return po(x.x+y.x,x.y+y.y);}
po operator -(po x,po y){return po(x.x-y.x,x.y-y.y);}
po operator *(po x,double y){return po(x.x*y,x.y*y);}
double cj(po x,po y){return x.x*y.y-x.y*y.x;}
po jd(Line a,Line b)//两直线的交点
{
po u=a.x-b.x;
double t=cj(b.v,u)/cj(a.v,b.v);
return a.x+a.v*t;
}
int cmp(Line a,Line b){return a.ang<b.ang;}
bool Onleft(Line L,po p){return dcmp(cj(L.v,p-L.x))>0;}
void halfp()
{
sort(L+1,L+n+1,cmp);
m=0;
head=tail=1; q[1]=L[1];
for (int i=2;i<=n;i++)
{
while (head<tail && !Onleft(L[i],p[tail-1])) --tail;
while (head<tail && !Onleft(L[i],p[head])) ++head;
q[++tail]=L[i];
if (dcmp(cj(q[tail].v,q[tail-1].v))==0)//两向量平行且同向
{
tail--;
if (Onleft(q[tail],L[i].x)) q[tail]=L[i];//取内侧的一个
}
if (head<tail) p[tail-1]=jd(q[tail],q[tail-1]);
}
while (head<tail && !Onleft(q[head],p[tail-1])) --tail;
if (tail-head<=1) return;
p[tail]=jd(q[tail],q[head]);
for (int i=head;i<=tail;i++) poly[++m]=p[i];
}
int main()
{
int id=0,T;scanf("%d",&T);
while (T--)
{
scanf("%d",&n);
double x,y;
for (int i=1;i<=n;i++)
{
scanf("%lf%lf",&x,&y);
d[i]=po(x,y);
}
for (int i=1;i<=n;i++) L[i]=Line(d[i],d[i]-d[i%n+1]);
halfp();
double ans=0;
po a=poly[1],b=poly[2];
for (int i=3;i<=m;i++) ans+=cj(poly[i]-a,b-a),b=poly[i];
ans=fabs(ans);
printf("%.2lf\n",ans/2+eps);
}
}