UVA11178 计算几何入门题

uva11178

这题非常简单，参照刘汝佳的竞赛书里面写了一个模板，理解起来非常简单易懂。

比如说求点D，先计算角ABC的值a，然后把射线BC逆时针旋转a/3，得到直线BD。同理可求得直线CD，然后求交点即可。

贴代码：

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
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 -(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);}
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;}
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 getP(Point A,Point B,Point C){
    Vector v1 = C-B;
    double a1 = Angle(A-B,v1);
    v1 = Rotate(v1,a1/3);

    Vector v2 = B-C;
    double a2 = Angle(A-C,v2);
    v2 = Rotate(v2,-a2/3); // clockwise rotate

    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 = getP(A,B,C);
       E = getP(B,C,A);
       F = getP(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;
}