BZOJ 1336&1337最小圆覆盖

最新推荐文章于 2021-01-12 21:18:39 发布

Sirius_Ren

最新推荐文章于 2021-01-12 21:18:39 发布

阅读量607

点赞数

分类专栏：计算几何文章标签：计算几何

本文链接：https://blog.csdn.net/qq_31785871/article/details/54133239

版权

计算几何专栏收录该内容

1 篇文章 0 订阅

订阅专栏

思路：
http://blog.csdn.net/commonc/article/details/52291822
（照着算法步骤写……）
已知三点共圆求圆心的时候就设一下圆心坐标(x,y) 解个方程就好了

//By SiriusRen
#include <cmath>
#include <cstdio>
#include <algorithm>
using namespace std;
int n;double R,tempx,tempy,tempz,tmpx,tmpy,tmpz;
struct Point{double x,y;}point[100050],Ans;
double Sqr(double x){return x*x;}
double dis(Point a,Point b){return sqrt(Sqr(a.x-b.x)+Sqr(a.y-b.y));}
bool in_circle(Point x){return dis(Ans,x)<=R;}
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%lf%lf",&point[i].x,&point[i].y);
    random_shuffle(point+1,point+n);
    for(int i=1;i<=n;i++)if(!in_circle(point[i])){
        Ans.x=point[i].x,Ans.y=point[i].y,R=0;
        for(int j=1;j<i;j++)if(!in_circle(point[j])){
            Ans.x=(point[i].x+point[j].x)/2;
            Ans.y=(point[i].y+point[j].y)/2;
            R=dis(Ans,point[j]);
            for(int k=1;k<j;k++)if(!in_circle(point[k])){
                tempz=point[j].x-point[i].x;
                tempx=2*(point[i].y-point[j].y)/tempz;
                tempy=(Sqr(point[j].x)+Sqr(point[j].y)-Sqr(point[i].x)-Sqr(point[i].y))/tempz;
                tmpz=point[k].x-point[j].x;
                tmpx=2*(point[j].y-point[k].y)/tmpz;
                tmpy=(Sqr(point[k].x)+Sqr(point[k].y)-Sqr(point[j].x)-Sqr(point[j].y))/tmpz;
                Ans.y=(tmpy-tempy)/(tempx-tmpx);
                Ans.x=(tempx*Ans.y+tempy)/2;
                R=dis(Ans,point[j]);
            }
        }
    }
    printf("%f\n%f %f\n",R,Ans.x,Ans.y);
}