计算几何 线段相交 模板

#include <cmath>
#include <cstdio>
#include <cstring>
double const INF = 1E200;
double const EPS = 1E-6;
double const PI = acos(-1.);
#define MAX(x,y) ( ( (x) > (y) ) ? (x) : (y) )
#define MIN(x,y) ( ( (x) < (y) ) ? (x) : (y) )
inline bool isZero(double x){return fabs(x)<EPS;}
inline bool isEqual(double x,double y){return fabs(x-y) < EPS;}

struct point_t{
	double x;
	double y;
	point_t(double xx=0.,double yy=0.){x=xx;y=yy;}
};
inline bool isEqual(point_t const &A,point_t const &B){
	double x = A.x - B.x;
	double y = A.y - B.y;
	double s = sqrt( x * x + y * y );
	return fabs(s) < EPS;
}

struct lineseg_t{
	point_t s;
	point_t e;
	lineseg_t(double x1=0.,double y1=0.,double x2=0.,double y2=0.){
		s.x = x1; s.y = y1; e.x = x2; e.y = y2;
	}
};

double cross(point_t const &O,point_t const &A,point_t const &B){
	double xOA = A.x - O.x;
	double yOA = A.y - O.y;
	double xOB = B.x - O.x;
	double yOB = B.y - O.y;
	return xOA * yOB - xOB * yOA;
}

bool isOn(lineseg_t const &u,lineseg_t const &v){
    return MAX(u.s.x,u.e.x) >= MIN(v.s.x,v.e.x)
        && MAX(v.s.x,v.e.x) >= MIN(u.s.x,u.e.x)
        && MAX(u.s.y,u.e.y) >= MIN(v.s.y,v.e.y)
        && MAX(v.s.y,v.e.y) >= MIN(u.s.y,u.e.y)
        && cross(v.s,u.e,v.e) * cross(v.s,v.e,u.s) >= 0
        && cross(u.s,v.e,u.e) * cross(u.s,u.e,v.s) >= 0;
}