ZOJ1450 Minimal Circle

You are to write a program to find a circle which covers a set of points and has the minimal area. There will be no more than 100 points in one problem.

Input

The input contains several problems. The first line of each problem is a line containing only one integer N which indicates the number of points to be covered. The next N lines contain N points. Each point is represented by x and y coordinates separated by a space. After the last problem, there will be a line contains only a zero.

Output

For each input problem, you should give a one-line answer which contains three numbers separated by spaces. The first two numbers indicate the x and y coordinates of the result circle, and the third number is the radius of the circle. (use escape sequence %.2f)

Sample Input

2
0.0 0.0
3 0
5
0 0
0 1
1 0
1 1
2 2
0

Sample Output

1.50 0.00 1.50
1.00 1.00 1.41

数学问题 几何

最小圆覆盖，随机增量法

其实就是枚举两个点作为圆直径上的两点，发现有点在当前圆外时，就调整直径……

随机增量法求最小圆覆盖。

三重循环。

令ci为前i个点的覆盖圆，新加入一个点i+1时，若其在圆内，跳过，若其在圆外，修改圆心使i+1在圆c(i+1)上。

检查之前的点，令ci为前i个点的覆盖圆，且点j在圆周上，若第i+1个点无法被圆覆盖，修改圆心使点i+1和点j都在圆周上。

检查之前的点，令ci为前i个点的覆盖圆，且点j和点k在圆周上，若第i+1个点无法被圆覆盖，修改圆心使点i+1和点j、点k都在圆周上

这算法倒是还能理解，但是求外心的几何算法表示看不懂。这个技能还是等高二再解锁吧。

　　　　　　——高一时候的博主

↑什么解锁技能啊……现在一回顾，就是设外心坐标，根据外心到三个顶点的距离相等来暴力列方程，解出来个表达式就行……

 /*by SilverN*/
 #include<algorithm>
 #include<iostream>
 #include<cstring>
 #include<cstdio>
 #include<cmath>
 using namespace std;
 const double eps=1e-;
 const int mxn=;
 struct Point{
     double x,y;
     Point operator + (Point rhs){return (Point){x+rhs.x,y+rhs.y};}
     Point operator - (Point rhs){return (Point){x-rhs.x,y-rhs.y};}
     double cross(Point rhs){return x*rhs.y-y*rhs.x;}
     friend double dist(Point a,Point b){
         return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
     }
 }p[mxn],O;
 int n;
 double r;
 void clc(Point p1,Point p2,Point p3){//计算三角形外心
     double a=*(p2.x-p1.x);
     double b=*(p2.y-p1.y);
     double c=p2.x*p2.x+p2.y*p2.y-p1.x*p1.x-p1.y*p1.y;
     double d=*(p3.x-p1.x);
     double e=*(p3.y-p1.y);
     double f=p3.x*p3.x+p3.y*p3.y-p1.x*p1.x-p1.y*p1.y;
     O.y=(d*c-a*f)/(b*d-e*a);
     O.x=(b*f-e*c)/(b*d-e*a);
     r=dist(O,p1);
     return;
 }
 int main(){
     int i,j;
     while(scanf("%d",&n) && n){
         for(i=;i<=n;i++){scanf("%lf%lf",&p[i].x,&p[i].y);}
         O=p[];r=;
         for(int i=;i<=n;i++)
             if(dist(O,p[i])>r+eps){
                 O=p[i];r=;
                 for(j=;j<i;j++){
                     if(dist(O,p[j])>r+eps){
                         O.x=(p[i].x+p[j].x)/;
                         O.y=(p[i].y+p[j].y)/;
                         r=dist(O,p[j]);
                         for(int k=;k<j;k++){
                             if(dist(O,p[k])>r+eps)
                                 clc(p[i],p[j],p[k]);
                         }
                     }
                 }
             }
         printf("%.2f %.2f %.2f\n",O.x,O.y,r);
     }
     return ;
 }