poj 3808 Malfatti Circles

//纯粹的几何公式推导

 

#include<cstdio>
#include<iostream>
#include<cmath>
using namespace std;
struct Point{double x, y;}A, B, C, I;
double dist(Point p1, Point p2){
    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
int main(){
    double s, r, r1, r2, r3, a, b, c, ia, ib, ic;
    while(scanf("%lf%lf%lf%lf%lf%lf", &A.x, &A.y, &B.x, &B.y, &C.x, &C.y)){
        if(A.x==0&&B.x==0&&A.y==0&&B.y==0)break;
        a=dist(B, C);
        b=dist(A, C);
        c=dist(A, B);
        s=(a+b+c)/2;
        I.x=(a*A.x+b*B.x+c*C.x)/(a+b+c);
        I.y=(a*A.y+b*B.y+c*C.y)/(a+b+c);
        r=sqrt(s*(s-a)*(s-b)*(s-c))/s;
        ia=dist(A, I);
        ib=dist(B, I);
        ic=dist(C, I);
        r1=r/(2*(s-a))*(s-r+ia-ib-ic);
        r2=r/(2*(s-b))*(s-r+ib-ia-ic);
        r3=r/(2*(s-c))*(s-r+ic-ib-ia);
        printf("%.6f %.6f %.6f\n", r1, r2, r3);
    }
    return 0;
}