二维几何基础
常用定义
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;}//叉积
double Area2(Point A,Point B,Point C){return Cross(B-A,C-A);}//向量AB和向量AC的叉积
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));
}
Vector Normal(Vector A){//计算向量的单位法线,即左旋90度以后把长度归一化,保证A不是零向量
double L = Length(A);
return Vector(-A.y/L,A.x/L);
}
点和直线
直线的参数表示
直线可以使用直线上一点Po和方向向量v来表示。直线上的所有的点可以被表示成P = Po + tv
其中 t 称为参数。如果已经知道直线了两个不同点 A B ,则方向向量为 B-A ,所以参数方程为 A+(B-A)t , 对于射线 t > 0 ,线段的 t 在 0 ~ 1 之间
struct Line{
Point p;
Vector v;
Line(double px,double py,double ex,double ey):p(px,py),v(ex-px,ey-py){}
Line(double px,double py,Point a):
p(px,py),v(a.x-px,a.y-py){}
Line(Point a,Point b):
p(a.x,b.x),v(b.x-a.x,b.y-a.y){}
Point point(int x)//已知一点的横坐标,求其点
{
double t=(x-p.x)/v.x;
return Point(x,p.y+t*v.y);
}
};
参数方程下的各种计算公式为
直线相交 P+tv 和 Q+tw , 当且仅当Cross(v,w)不为零
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;
//返回直线p+tv和q+tw的交点(v,w分别是两条线的方向向量,u=P-Q,p和q分别是直线上的一点)
//需要注意的是Cross(v,w)不能共线
}
点到直线的距离,即用平行四边形的面积除以底
double Distancetoline(Point P,Point A,Point B)
{
Vector v1=B-A,v2=P-A;
return fabs(Cross(v1,v2))/Length(v1);
//求得p到直线ab的距离
}
点到线段的距离
设投影点为Q,当Q在线段AB上,则所求距离就是P点到直线AB的距离(左图),否则就是PA和PB中较短的的距离。判断点Q的位置可以用点积进行。
double Distancetosegment(Point P,Point A,Point B)
{
if(A==B) return Length(P-A);
Vector v1=B-A,v2=P-A,v3=P-B;
if(dcmp(Dot(v1,v2))<0) return Length(v2);
if(dcmp(Dot(v1,v3))>0) return Length(v3);
return fabs(Cross(v1,v2))/Length(v1);
//求得p到直线ab的最小距离
}
点在直线上的投影
Point GetLineProjection(Point p,Point a,Point b)
{
Vector v=b-a;
return a+v*(Dot(v,p-a) /Dot(v,v));
//p在直线ab上的投影点
}
线段相交,线段规范相交的条件是每条线段的两个端点都在另一条线段的两侧,即叉积符号不同
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
double c1=Cross(a2-a1,b1-a1),c2=Cross(a2-a1,b2-a1),
c3=Cross(b2-b1,a1-b1),c4=Cross(b2-b1,a2-a1);
return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0;
//判断a1a2与b1b2是否相交(交点不在a1,a2,b1,b2上)
//如果c1c2表示两直线共线
}
当c1c2不同时为零时,还有一种一条线段在另一条直线上的端点的情况,需要用下函数判断某点是否在直线上
bool OnSegment(Point p,Point a1,Point a2)
{
return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0;
//用叉乘判断时候在这条直线上,用点乘判断是否在线段中
//判断p点是否在线段a1a2上
}
多边形
多边形的面积,将多边形分成三角形计算
double ConvexPolygonArea(Point *p,int n){
double area = 0;
for(int i=1;i<n-1;i++)
area += Cross(p[i]-p[0],p[i+1]-p[0]);
return area/2;
}
全部代码
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);}
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);}//向量AB和向量AC的叉积
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));
}
Vector Normal(Vector A){//计算向量的单位法线,即左旋90度以后把长度归一化,保证A不是零向量
double L = Length(A);
return Vector(-A.y/L,A.x/L);
}
struct Line{
Point p;
Vector v;
Line(double px,double py,double ex,double ey):p(px,py),v(ex-px,ey-py){}
Line(double px,double py,Point a):
p(px,py),v(a.x-px,a.y-py){}
Line(Point a,Point b):
p(a.x,b.x),v(b.x-a.x,b.y-a.y){}
Point point(int x)//已知一点的横坐标,求其点
{
double t=(x-p.x)/v.x;
return Point(x,p.y+t*v.y);
}
};
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;
//返回直线p+tv和q+tw的交点(v,w分别是两条线的方向向量,u=P-Q,p和q分别是直线上的一点)
//需要注意的是Cross(v,w)不能共线
}
double Distancetoline(Point P,Point A,Point B)
{
Vector v1=B-A,v2=P-A;
return fabs(Cross(v1,v2))/Length(v1);
//求得p到直线ab的距离
}
double Distancetosegment(Point P,Point A,Point B)
{
if(A==B) return Length(P-A);
Vector v1=B-A,v2=P-A,v3=P-B;
if(dcmp(Dot(v1,v2))<0) return Length(v2);
if(dcmp(Dot(v1,v3))>0) return Length(v3);
return fabs(Cross(v1,v2))/Length(v1);
//求得p到直线ab的最小距离
}
Point GetLineProjection(Point p,Point a,Point b)
{
Vector v=b-a;
return a+v*(Dot(v,p-a) /Dot(v,v));
//p在直线ab上的投影点
}
bool SegmentProperIntersection(Point a1,Point a2,Point b1,Point b2)
{
double c1=Cross(a2-a1,b1-a1),c2=Cross(a2-a1,b2-a1),
c3=Cross(b2-b1,a1-b1),c4=Cross(b2-b1,a2-a1);
return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0;
//判断a1a2与b1b2是否相交(交点不在a1,a2,b1,b2上)
//如果c1c2表示两直线共线
}
bool OnSegment(Point p,Point a1,Point a2)
{
return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0;
//用叉乘判断时候在这条直线上,用点乘判断是否在线段中
//判断p点是否在线段a1a2上
}
double ConvexPolygonArea(Point *p,int n){
double area = 0;
for(int i=1;i<n-1;i++)
area += Cross(p[i]-p[0],p[i+1]-p[0]);
return area/2;
}
凸包
int ConvexHull(int n,Point *ch){
sort(p, p+n);
int m = 0;
for(int i=0;i<n;i++){
while(m>1&&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
ch[m++] = p[i];
}
int k = m;
for(int i=n-2;i>=0;i--){
while(m>k&&Cross(ch[m-1]-ch[m-2],p[i]-ch[m-2])<=0) m--;
ch[m++] = p[i];
}
if(n>1) m--;
return m;
}