这个题用到了点积求角度,向量的旋转以及两直线求交点。
少定义了中间变量就很麻烦,还是把变量名子写好才不出错。
一开始担心正负号的问题,因为是求交点,这个问题好像并不存在。
核心的思路:求角度大小,旋转边向量,求交点。
求出一个交点,旋转求三个顶点的顺序,求出另外两个点。
AC代码:
#include<bits/stdc++.h>
using namespace std;
struct Point{
double x,y;
Point(double x=0,double y=0):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 - (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); }
bool operator < (const Point&a,const Point&b){
return a.x<b.x||(a.x==b.x && a.y<b.y);
}
const double eps=1e-10;
int dcmp(double x){
if(fabs(x)<eps) return 0; else return x < 0 ? -1 : 1;
}
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 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; }
/**
first input right Edge,Cross product be Positive.
*/
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));
}
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 getDEF(Point P,Point Q,Point R){
Vector v1 = Q-P;
double a = Angle(R-P,Q-P);
Vector v = Rotate(v1,a/3.0);
Vector v2 = R-Q;
double b = Angle(R-Q,P-Q);
Vector w = Rotate(v2,+b*2.0/3.0);
return GetLineIntersection(P,v,Q,w);
}
int main()
{
int t;
scanf("%d",&t);
while(t--){
Point A,B,C;
scanf("%lf%lf%lf%lf%lf%lf",&A.x,&A.y,&B.x,&B.y,&C.x,&C.y);
Point F = getDEF(A,B,C);
Point D = getDEF(B,C,A);
Point E = getDEF(C,A,B);
printf("%.6lf %.6lf %.6lf %.6lf %.6lf %.6lf\n",D.x,D.y,E.x,E.y,F.x,F.y);
}
return 0;
}
血洗几何