uva11178 Morley’s Theorem（求三角形的角三分线围成三角形的点）

Morley’s Theorem Input: Standard Input

Output: Standard Output

Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of angles A, B and C has intersected and created an equilateral triangle DEF.

Of course the theorem has various generalizations, in particular if all of the tri-sectors are intersected one obtains four other equilateral triangles. But in the original theorem only tri-sectors nearest to BC are allowed to intersect to get point D, tri-sectors nearest to CA are allowed to intersect point E and tri-sectors nearest to AB are intersected to get point F. Trisector like BD and CE are not allowed to intersect. So ultimately we get only one equilateral triangle DEF. Now your task is to find the Cartesian coordinates of D, E and F given the coordinates of A, B, and C.

Input

First line of the input file contains an integer N (0<N<5001) which denotes the number of test cases to follow. Each of the next lines contain sixintegers . This six integers actually indicates that the Cartesian coordinates of point A, B and C are  respectively. You can assume that the area of triangle ABC is not equal to zero,  and the points A, B and C are in counter clockwise order.

Output

For each line of input you should produce one line of output. This line contains six floating point numbers  separated by a single space. These six floating-point actually means that the Cartesian coordinates of D, E and F are  respectively. Errors less than   will be accepted.

Sample Input   Output for Sample Input

2 1 1 2 2 1 2 0 0 100 0 50 50

1.316987 1.816987 1.183013 1.683013 1.366025 1.633975 56.698730 25.000000 43.301270 25.000000 50.000000 13.397460

---

tijie:

tijie: 错的心酸。。。只需要求出两条直线求交点；

代码：

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 using namespace std;
 const double eps=1e-;
 struct Point{
     double x,y;
     Point(double x=,double y=):x(x),y(y){}
 };
 typedef Point Vector;
 Vector operator + (Vector A, Vector B) { return Vector(A.x + B.x, A.y + B.y); }
 Vector operator - (Point A, Point 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); }
 bool operator < (const Point &a,const Point &b){
     return a.x<b.x||(a.x==b.x&&a.y<b.y);//排序
 }
 int dcmp(double x){//
     if(fabs(x)<eps)return ;
      return x<?-:;
 }
 bool operator == (const Point &a,const Point &b){
     return dcmp(a.x-b.x)==&&dcmp(a.y-b.y)==;
 }
 double Dot(Vector A, Vector B) { return A.x * B.x + A.y * B.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 Cross(Vector A, Vector B) { return A.x * B.y - A.y * B.x; } //叉乘
 double Area(Point A, Point B, Point C) { return Cross(B - A, C - A); } //三个点组成的三角形的面积

 Vector Rotate(Vector A, double rad) { //向量A逆时针旋转rad弧度后的坐标
     return Vector(A.x * cos(rad) - A.y * sin(rad), A.x * sin(rad) + A.y * cos(rad));
 }

 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;
 }
 Point getD(Point A,Point B,Point C){
     Vector v1=C-B;
     double a1=Angle(A-B,v1);
     v1=Rotate(v1,a1/);//少了ROTATE。。。。。。
     Vector v2=B-C;
     double a2=Angle(A-C,v2);
     v2=Rotate(v2,-a2/);
     //printf("%lf %lf %lf %lf %lf %lf\n",v1.x,v1.y,v2.x,v2.y,a1/3,a2/3);
     return GetLineIntersection(B,v1,C,v2);
 }
 int main(){
     int T;
     Point a,b,c,d,e,f;
     scanf("%d",&T);
     while(T--){
         scanf("%lf%lf%lf%lf%lf%lf",&a.x, &a.y, &b.x, &b.y, &c.x, &c.y);
         d=getD(a,b,c);
         e=getD(b,c,a);
         f=getD(c,a,b);
          printf("%lf %lf %lf %lf %lf %lf\n",d.x,d.y,e.x,e.y,f.x,f.y);
     }
     return ;
 }