解题思路:
在圆的半径相等的情况下,圆角凸包就相当于圆心凸包每条边向外平移至外切线(两圆心与两切点组成的是矩形)再在各个角加上一段圆弧,可以证明,这些圆弧拼起来就是一个圆。如图:
所以先求圆心凸包,再加上一个圆的周长即可。
#include<bits/stdc++.h>
using namespace std;
const int N=100005;
const double PI=acos(-1.0);
struct point
{
double x,y;
point(){}
point(double _x,double _y):x(_x),y(_y){}
inline friend point operator + (const point &a,const point &b)
{return point(a.x+b.x,a.y+b.y);}
inline friend point operator - (const point &a,const point &b)
{return point(a.x-b.x,a.y-b.y);}
inline friend point operator * (const point &a,const double &b)
{return point(a.x*b,a.y*b);}
inline friend double operator * (const point &a,const point &b)
{return a.x*b.y-a.y*b.x;}
inline double dis(){return sqrt(x*x+y*y);}
}p[N];
int n,m,top;
double A,B,R,ans;
inline bool cmp(const point &a,const point &b)
{
double res=(a-p[1])*(b-p[1]);
if(res)return res>0;
return (a-p[1]).dis()<(b-p[1]).dis();
}
void graham()
{
int id=1;
for(int i=2;i<=m;i++)
if((p[i].x<p[id].x)||(p[i].x==p[id].x&&p[i].y<p[id].y))id=i;
swap(p[1],p[id]);sort(p+2,p+m+1,cmp);top=1;
for(int i=2;i<=m;i++)
{
while(top>1&&(p[top-1]-p[i])*(p[top]-p[i])<=0)top--;
p[++top]=p[i];
}p[++top]=p[1];
for(int i=1;i<top;i++)ans+=(p[i+1]-p[i]).dis();
}
int main()
{
//freopen("lx.in","r",stdin);
scanf("%d%lf%lf%lf",&n,&A,&B,&R),A=A/2-R,B=B/2-R;
for(int i=1;i<=n;i++)
{
point o,t;double ang,Cos,Sin,x,y;
scanf("%lf%lf%lf",&o.x,&o.y,&ang);
Cos=cos(ang),Sin=sin(ang);
x=B*Cos-A*Sin,y=A*Cos+B*Sin,p[++m]=o+point(x,y);
x=B*Cos+A*Sin,y=-A*Cos+B*Sin,p[++m]=o+point(x,y);
x=-B*Cos+A*Sin,y=-A*Cos-B*Sin,p[++m]=o+point(x,y);
x=-B*Cos-A*Sin,y=A*Cos-B*Sin,p[++m]=o+point(x,y);
}
graham();
ans+=2*R*PI;
printf("%0.2lf\n",ans);
return 0;
}