poj1673---计算几何

//简单题，按题目要求求就行。
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define eps 1e-8
#define dist(a,b) sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y))
#define cross(a,b,c) (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x)
#define dot(a,b,c) (b.x-a.x)*(c.x-a.x)+(b.y-a.y)*(c.y-a.y)
#define delt(a) fabs(a)<eps?0:a>0?1:-1
#define N 105
#define inf 1e20
using namespace std;
struct TPoint
{
    double x,y;
}a,b,c;
int n,m,t,end;
void scan()//输入
{
	scanf("%lf%lf",&a.x,&a.y);
	scanf("%lf%lf",&b.x,&b.y);
	scanf("%lf%lf",&c.x,&c.y);
}
void getmove(TPoint &a1,TPoint &b1,double r)
{
	TPoint ms;
	ms.x=b1.y-a1.y,ms.y=a1.x-b1.x;
	double k=r/dist(a1,b1);
	a1.x+=ms.x*k,a1.y+=ms.y*k;
	b1.x+=ms.x*k,b1.y+=ms.y*k;
}
void solve(TPoint a1,TPoint b1,TPoint c1,TPoint d1)
{
	double s1=cross(a1,c1,d1),s2=cross(b1,c1,d1);
	double x,y;
	x=(s2*a1.x-s1*b1.x)/(s2-s1);
	y=(s2*a1.y-s1*b1.y)/(s2-s1);
	if(fabs(x)<eps) x=0;
	if(fabs(y)<eps) y=0;
	printf("%.4f %.4f\n",x,y);
}
void solve()
{
	double s1=cross(a,b,c);
	int d1=delt(s1);
	if(d1<0) swap(b,c);
	TPoint a1,a2,b1,b2,c1,c2,d,e;
	a1=a,a2=b;
	b1=b,b2=c;
	c1=c,c2=a;
	getmove(a1,a2,dist(a1,a2));
	getmove(b1,b2,dist(b1,b2));
	getmove(c1,c2,dist(c1,c2));
	d.x=(a2.x+b1.x)/2,d.y=(a2.y+b1.y)/2;
	e.x=(b2.x+c1.x)/2,e.y=(b2.y+c1.y)/2;
	solve(d,b,e,c);
}
int main()
{
	scanf("%d",&n);
    while(n--)
    {
		scan();
		solve();
    }
    return 0;
}