LA4642 Malfatti Circles Malfatti 定理 Tokyo 2009

题目地址：LA4642

给定三角形，求Malfatti圆三个圆的半径。

关于这个定理wikipedia  上面列举了计算公式

定理的证明，可以参见单遵教授编写的《平面几何中的小花》

代码：

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
const double eps=1e-10;
const double PI=acos(-1);

using namespace std;


struct Point{
    double x;
    double y;
    Point(double x=0,double y=0):x(x),y(y){}
    void operator<<(Point &A) {cout<<A.x<<' '<<A.y<<endl;}
};

int dcmp(double x)  {return (x>eps)-(x<-eps); }

typedef  Point  Vector;

Vector  operator +(Vector A,Vector B) { return Vector(A.x+B.x,A.y+B.y);}

Vector  operator -(Vector A,Vector B) { return Vector(A.x-B.x,A.y-B.y); }

Vector  operator *(Vector A,double p) { return Vector(A.x*p,A.y*p);  }

Vector  operator /(Vector A,double p) {return Vector(A.x/p,A.y/p);}

// ps  cout

ostream &operator<<(ostream & out,Point & P) { out<<P.x<<' '<<P.y<<endl; return out;}

bool  operator< (const Point &A,const Point &B) { return A.x<B.x||(A.x==B.x&&A.y<B.y); }

bool  operator== ( const Point &A,const Point &B) { return dcmp(A.x-B.x)==0&&dcmp(A.y-B.y)==0;}


double  Dot(Vector A,Vector B) {return A.x*B.x+A.y*B.y;}

double  Cross(Vector A,Vector B)  {return A.x*B.y-B.x*A.y; }

double  Length(Vector A)  { return sqrt(Dot(A, A));}


double  Angle(Vector A,Vector B) {return acos(Dot(A,B)/Length(A)/Length(B));}

double  Area2(Point A,Point B,Point C ) {return Cross(B-A, C-A);}

Vector Rotate(Vector A,double rad) { return Vector(A.x*cos(rad)-A.y*sin(rad),A.x*sin(rad)+A.y*cos(rad));}
Vector Normal(Vector A) {double L=Length(A);return Vector(-A.y/L,A.x/L);}

Point GetLineIntersection(Point P,Vector v,Point Q,Vector w)
{
    Vector u=P-Q;
    double t=Cross(w, u)/Cross(v,w);
    return P+v*t;
    
}

double DistanceToLine(Point P,Point A,Point B)
{
    Vector v1=P-A; Vector v2=B-A;
    return fabs(Cross(v1,v2))/Length(v2);
    
}

double DistanceToSegment(Point P,Point A,Point B)
{
    if(A==B)  return Length(P-A);
    
    Vector v1=B-A;
    Vector v2=P-A;
    Vector v3=P-B;
    
    if(dcmp(Dot(v1,v2))==-1)    return  Length(v2);
    else if(Dot(v1,v3)>0)    return Length(v3);
    
    else return DistanceToLine(P, A, B);
    
}

Point GetLineProjection(Point P,Point A,Point B)
{
    Vector v=B-A;
    Vector v1=P-A;
    double t=Dot(v,v1)/Dot(v,v);
    
    return  A+v*t;
}

bool  SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
    double c1=Cross(b1-a1, a2-a1);
    double c2=Cross(b2-a1, a2-a1);
    double c3=Cross(a1-b1, b2-b1);
    double c4=Cross(a2-b1, b2-b1);
    
    //cout<<c1<<c2<<c3<<c4<<endl;
    return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0 ;
    
}

bool  OnSegment(Point P,Point A,Point B)
{
    return dcmp(Cross(P-A, P-B))==0&&dcmp(Dot(P-A,P-B))<0;
}

double PolygonArea(Point *p,int n)
{
    double area=0;
    
    for(int i=1;i<n-1;i++)
    {
        area+=Cross(p[i]-p[0], p[i+1]-p[0]);
        
    }
    return area/2;
    
}

Point  read_point()
{
    Point P;
    scanf("%lf%lf",&P.x,&P.y);
    return  P;
}

Point getA(Point P,Point Q,Point R,double a,double b,double c)
{
    double r1=a*b/(a*b+1+a);
    double r2=(c*(a+1))/(1+c*(a+1));
    
    double r=(1-r1)/(1-r1-r2);
    Vector PA=(R-P)*r;
    return PA+P;
}

Point Incenter(Point A,Point B,Point C)     //求内心坐标  注意旋转角度
{
//    if(Cross(B-C,B-A)<0)
//    {
//        
//    }
    
    double ABC=Angle(A-B,C-B);
    Vector BI=Rotate(C-B, ABC/2);
    
    double ACB=Angle(A-C,B-C);
    Vector CI=Rotate(B-C, -ACB/2);
    
    Point I=GetLineIntersection(B, BI, C, CI);
    
    return I;
    
}



int main()
{
    Point A,B,C;
    Point Zero;
    while(1)
    {
        A=read_point();
        B=read_point();
        C=read_point();
        
        if(A==Zero&&B==Zero&&C==Zero)  break;
        
        double area=fabs(Cross(B-A,C-A));
        area/=2;
        
        Point I=Incenter(A,B,C);
        //cout<<I<<endl;
        
        double r=DistanceToLine(I, A, B);
        
        double IA=Length(I-A);
        double IB=Length(I-B);
        double IC=Length(I-C);
        
        double a,b,c;
        a=Length(B-C);
        b=Length(C-A);
        c=Length(A-B);
        
        
        double  p=(a+b+c)/2;
        
        double r1=r/(p-a)/2*(p-r+IA-IB-IC);
        double r2=r/(p-b)/2*(p-r+IB-IA-IC);
        double r3=r/(p-c)/2*(p-r+IC-IA-IB);

        printf("%.6lf %.6lf %.6lf\n",r1,r2,r3);
        
    }
}

虽然ac了 但是认为求内心坐标的时候应该更严格一点，

oint Incenter(Point A,Point B,Point C)     //求内心坐标  注意旋转角度
{
    if(Cross(B-C,B-A)<0)
    {
        Point temp=A;
        A=C;
        C=temp;
    }
    
    double ABC=Angle(A-B,C-B);
    Vector BI=Rotate(C-B, ABC/2);
    
    double ACB=Angle(A-C,B-C);
    Vector CI=Rotate(B-C, -ACB/2);
    
    Point I=GetLineIntersection(B, BI, C, CI);
    
    return I;
    
}