计算几何-HPI

This article is made by Jason-Cow.
Welcome to reprint.
But please post the article's address.

 

在线笛卡尔坐标系绘图网站

核心思想

　　1.积角排序

　　2.双端队列维护半平面交

木有啦～～

 int HPI(L*l,int n,D*ans){
   int head,tail,m=;D*P=new D[n];L*q=new L[n];
   sort(l+,l+n+),q[head=tail=]=l[];
   for(int i=;i<=n;i++){
     while(head<tail && !Left(l[i],P[tail-]))tail--;
     while(head<tail && !Left(l[i],P[head]))  head++;
     q[++tail]=l[i];//双端队列<(￣3￣)>
     if(fabs(Cross(q[tail].v,q[tail-].v))<eps){
       tail--;//判断Cross(q[tail].v,q[tail-1].v)==0♪(^∇^*)
       if(Left(q[tail],l[i].P))q[tail]=l[i];
     }
     if(head<tail)P[tail-]=Intersect(q[tail-],q[tail]);
   }
   while(head<tail && !Left(q[head],P[tail-]))tail--;
   if(tail-head<=)return ;
   P[tail]=Intersect(q[tail],q[head]);
   for(int i=head;i<=tail;i++)ans[++m]=P[i];
   return m;
 }

多边形相关

db Area(D*R,int n){
    db S=0.0;
    for(int i=;i<n;i++)S+=Cross(R[i]-R[],R[i+]-R[]);
    return S/;
}
 
db Length(D*R,int n){
    db C=0.0;
    for(int i=;i<=n;i++)C+=Dis(R[i],R[i-]);
    return C+Dis(R[n],R[]);
}

主程序

 L l[];D A[];
 int main(){
   for(int n;scanf("%d",&n)&&n;){
     for(int i=;i<=n;i++){
       db a,b,c,d;
       scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
       D A(a,b),B(c,d);
       l[i]=L(A,B-A);
     }
     int m=HPI(l,n,A);
     cout<<"m="<<m<<endl;
     for(int i=;i<=m;i++)printf("(%.4lf,%.4lf)\n",A[i].x,A[i].y);
     printf("S=%.2lf\n",Area(A,m));
     printf("C=%.2lf\n",Length(A,m));
   }
   return ;
 }

读入，如图（橙、红、蓝、绿）

4
2 1 1 2
1 2 0 1
1 0 2 1
0 1 1 0

输出

m=4
(0.0000,1.0000)
(1.0000,0.0000)
(2.0000,1.0000)
(1.0000,2.0000)
S=2.00
C=5.66

读入

6
1 2 0 1
0 1.8 0.8 0.2
0 1 1 0
1 0 2 1
3 0 1 2
0.6 1.6 0 0.7

输出

m=6
(0.6000,1.6000)
(0.3143,1.1714)
(0.8000,0.2000)
(1.0000,0.0000)
(2.0000,1.0000)
(1.0000,2.0000)
S=1.76
C=5.28

完整代码

 #include <algorithm>
 #include <iostream>
 #include <cstring>
 #include <cstdlib>
 #include <cstdio>
 #include <vector>
 #include <cmath>
 #include <queue>
 #include <map>
 #include <set>
 using namespace std;
 #define sqr(x) ((x)*(x))
 #define RG register
 #define op operator
 #define IL inline
 typedef double db;
 typedef bool bl;
 const db pi=acos(-1.0),eps=1e-;
 struct D{
   db x,y;
   D(db x=0.0,db y=0.0):x(x),y(y){}
 };
 typedef D V;//不知道什么鬼，emacs 将 operator -> op 会萎掉  对！不！齐！
 bl operator<(D A,D B){return A.x<B.x||(A.x==B.x&&A.y<B.y);}
 V operator+(V A,V B){return V(A.x+B.x,A.y+B.y);}
 V operator-(V A,V B){return V(A.x-B.x,A.y-B.y);}
 V operator*(V A,db N){return V(A.x*N,A.y*N);}
 V operator/(V A,db N){return V(A.x/N,A.y/N);}
 
 db Ang(db x){return(x*180.0/pi);}
 db Rad(db x){return(x*pi/180.0);}
 V Rotate(V A,db a){return V(A.x*cos(a)-A.y*sin(a),A.x*sin(a)+A.y*cos(a));}
 db Dis(D A,D B){return sqrt(sqr(A.x-B.x)+sqr(A.y-B.y));}
 db Cross(V A,V B){return A.x*B.y-A.y*B.x;}
 
 db Area(D*R,int n){
     db S=0.0;
     for(int i=;i<n;i++)S+=Cross(R[i]-R[],R[i+]-R[]);
     return S/;
 }
 
 db Length(D*R,int n){
     db C=0.0;
     for(int i=;i<=n;i++)C+=Dis(R[i],R[i-]);
     return C+Dis(R[n],R[]);
 }
 
 struct L{
   D P,v;
   db a;
   L(){}
   L(D P,V v):P(P),v(v){a=atan2(v.y,v.x);}
   bool operator<(const L x)const{return a<x.a;}
 };
 
 D Intersect(L a,L b){
   V u=a.P-b.P;
   return a.P+a.v*(Cross(b.v,u)/Cross(a.v,b.v));
 }
 
 bool Left(L l,D A){
   return Cross(l.v,A-l.P)>;
 }
 
 int HPI(L*l,int n,D*ans){
   int head,tail,m=;D*P=new D[n];L*q=new L[n];
   sort(l+,l+n+),q[head=tail=]=l[];
   for(int i=;i<=n;i++){
     while(head<tail && !Left(l[i],P[tail-]))tail--;
     while(head<tail && !Left(l[i],P[head]))  head++;
     q[++tail]=l[i];//双端队列<(￣3￣)>
     if(fabs(Cross(q[tail].v,q[tail-].v))<eps){
       tail--;//判断Cross(q[tail].v,q[tail-1].v)==0♪(^∇^*)
       if(Left(q[tail],l[i].P))q[tail]=l[i];
     }
     if(head<tail)P[tail-]=Intersect(q[tail-],q[tail]);
   }
   while(head<tail && !Left(q[head],P[tail-]))tail--;
   if(tail-head<=)return ;
   P[tail]=Intersect(q[tail],q[head]);
   for(int i=head;i<=tail;i++)ans[++m]=P[i];
   return m;
 }
 
 L l[];
 D A[];
 int main(){
   cout<<*sqrt()<<endl;
   for(int n;scanf("%d",&n)&&n;){
     for(int i=;i<=n;i++){
       db a,b,c,d;
       scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
       D A(a,b),B(c,d);
       l[i]=L(A,B-A);
     }
     int m=HPI(l,n,A);
     cout<<"m="<<m<<endl;for(int i=;i<=m;i++)printf("(%.4lf,%.4lf)\n",A[i].x,A[i].y);
     printf("S=%.2lf\n",Area(A,m));
     printf("C=%.2lf\n",Length(A,m));
   }
   return ;
 }

HPI