【计算几何】-poj1066-Treasure Hunt

题意

有一个正方形，里面有很多线段，并且线段的2端点都在正方形上，现在问你如果我要离开这个正方形。最少穿过几个线段（正方形的边也算线段）

题解

暴力枚举，在正方形的边每隔0.5取一个点，计算出最小的情况，输出即可

如果端点不保证是整数的情况下怎么做呢？

我们把端点极角排序，取每相邻的一对端点去验证就行了

代码

work对应暴力枚举

work2对应离散化版本

#include <iostream>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;
const double eps=1e-10;
const double PI=acos(-1.0);

struct Point{
    double x,y;
    Point(double x=0,double y=0):x(x),y(y){}
};
typedef Point Vector;

Vector operator -(Point a,Point 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);//在有精度需求，比如使用lower_bound的时候，加上dcmp()
}
int dcmp(double x){
    if(fabs(x)<eps)return 0;
    if(x<0)return -1;
    return 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 Cross(Vector a,Vector b){
    return a.x*b.y-a.y*b.x;
}//叉积
double Length(Vector a){
    return sqrt(Dot(a,a));
}//长度
//返回逆时针旋转90度的单位法向量；
Vector Normal(Vector a){
    double l=Length(a);
    return Vector(-a.y/l,a.x/l);
}
//返回向量夹角，无方向
double Angle(Vector a,Vector b){
    return acos(Dot(a,b)/Length(a)/Length(b));
}
//逆时针旋转向量
Vector Rotate(Vector a,double rad){
    return Vector(a.x*cos(rad)-a.y*sin(rad),a.x*sin(rad)+a.y*cos(rad));
}
//求p+v*t与q+w*t的交点，使用时确保Cross(v,w)不等于0
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到直线ab的距离
double DistanceToline(Point p,Point a,Point b){
    Vector v1=p-a,v2=b-a;
    return fabs(Cross(v1,v2)/Length(v2));
}
//求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(p-a);
    else if(dcmp(Dot(v1,v3))>0)return Length(p-b);
    else return fabs(Cross(v1,v2)/Length(v1));
}
//线段a1a2与线段b1b2规范相交返回真
bool SegmenProperIntersection(Point a1,Point a2,Point b1,Point b2){
    double c1=Cross(a2-a1,b1-a1),c2=Cross(a2-a1,b2-a1);
    double c3=Cross(b2-b1,a1-b1),c4=Cross(b2-b1,a2-b1);
    return dcmp(c1)*dcmp(c2)<0&&dcmp(c3)*dcmp(c4)<0;
}
//点p在线段a1a2上返回真
bool OnSegment(Point p,Point a1,Point a2){
    return dcmp(Cross(a1-p,a2-p))==0&&dcmp(Dot(a1-p,a2-p))<0;
}
//点p在ab上的投影
Point GetLineProjection(Point P,Point A,Point B)
{
    Vector v=B-A;
    return A+v*(Dot(v,P-A)/Dot(v,v));
}
//与 x 轴的夹角，取值范围为 (-π，π]
double angle(Vector v){
    return atan2(v.y,v.x);
}
//求线段a1,a2到线段b1,b2的最短距离
double disSegmenttoSegment(Point a1,Point a2,Point b1,Point b2)
{
    double ans=DistanceToSegment(a1,b1,b2);
    ans=min(ans,DistanceToSegment(a2,b1,b2));
    ans=min(ans,DistanceToSegment(b1,a1,a2));
    ans=min(ans,DistanceToSegment(b2,a1,a2));
    return ans;
}

Point p[40][2],u;
int n;

/*void work()
{
    Point v(0,0);
    int ans=99999;
    for(int i=0;i<200;i++){
        int k=0;
        for(int i=0;i<n;i++){
            if(SegmenProperIntersection(u,v,p[i][0],p[i][1]))k++;
        }
        ans=min(ans,k);
        v.x+=0.5;
    }
    for(int i=0;i<200;i++){
        int k=0;
        for(int i=0;i<n;i++){
            if(SegmenProperIntersection(u,v,p[i][0],p[i][1]))k++;
        }
        ans=min(ans,k);
        v.y+=0.5;
    }
    for(int i=0;i<200;i++){
        int k=0;
        for(int i=0;i<n;i++){
            if(SegmenProperIntersection(u,v,p[i][0],p[i][1]))k++;
        }
        ans=min(ans,k);
        v.x-=0.5;
    }
    for(int i=0;i<200;i++){
        int k=0;
        for(int i=0;i<n;i++){
            if(SegmenProperIntersection(u,v,p[i][0],p[i][1]))k++;
        }
        ans=min(ans,k);
        v.y-=0.5;
    }
    cout<<"Number of doors = "<<ans+1<<endl;
}*/
bool cmp(Point& a,Point &b)
{
    return angle(a-u)<angle(b-u);
}
int getans(Point v)
{
    int k=0;
    for(int j=0;j<n;j++){
        if(SegmenProperIntersection(u,v,p[j][0],p[j][1]))k++;
    }
    return k;
}
void work2()
{
    vector<Point> q;
    for(int i=0;i<n;i++){
        for(int j=0;j<2;j++)q.push_back(p[i][j]);
    }
    sort(q.begin(),q.end(),cmp);
    if(q.size()>0)q.push_back(q[0]);
    int num=q.size();
    Point v;
    int ans=9999999;
    for(int i=0;i<num-1;i++){
        if(dcmp(q[i].x-q[i+1].x)==0||dcmp(q[i].y-q[i+1].y)==0){
            v=(q[i]+q[i+1])/2;
            ans=min(ans,getans(v));
        }
    }
    ans=min(ans,getans(Point(0,0)));
    ans=min(ans,getans(Point(0,100)));
    ans=min(ans,getans(Point(100,100)));
    ans=min(ans,getans(Point(100,0)));
    cout<<"Number of doors = "<<ans+1<<endl;
}
int main()
{
    cin>>n;
    for(int i=0;i<n;i++){
      cin>>p[i][0].x>>p[i][0].y>>p[i][1].x>>p[i][1].y;
    }
    cin>>u.x>>u.y;
    work2();
    return 0;
}