来自大白书的模板:
点的定义:
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-15;//精度根据题目要求调整
int dcmp(double x) { if (fabs(x)<eps) return 0; 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(A)); }//夹角
叉积:
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)); }//rad为弧度制
向量法线:
Vector Normal(Vector A) { double L=Length(A); return Vector(-A.y/L,A.x/L); } //即旋转90°后的单位向量