poj 2462 / hdu 1154 Cutting a polygon 线段在多边形内长度

//多边形点数为n，输入m条直线，分别输出它们在多边形内的长度，边界也算

//求出直线与多边形的所有交点，排序后，判断每一段线段是否在多边形内（判断中点是否在多边形内），求和。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
const double EP=1e-8;
inline double max(double x, double y){ return x>y?x:y;}
inline double min(double x, double y){ return x<y?x:y;}
int n, m, cnt;
struct Point{
    double x, y;
}p[1005], tp[1005];
struct Line{
    Point a, b;
};

bool cmpx(Point p1, Point p2){
    return p1.x<p2.x;
}
bool cmpy(Point p1, Point p2){
    return p1.y<p2.y;
}

double x_mult(Point sp, Point ep, Point op){
    return (sp.x-op.x)*(ep.y-op.y)-(sp.y-op.y)*(ep.x-op.x);
}
double dist(Point p1, Point p2){
    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
Point intersection(Point u1,Point u2,Point v1,Point v2){
      Point res=u1;
      double t=((u1.x-v1.x)*(v1.y-v2.y)-(u1.y-v1.y)*(v1.x-v2.x))/
               ((u1.x-u2.x)*(v1.y-v2.y)-(u1.y-u2.y)*(v1.x-v2.x));
     res.x+=(u2.x-u1.x)*t;
     res.y+=(u2.y-u1.y)*t;
     return res;
}

bool Point_In_Segment(Point a, Point b, Point t){       //判断点在线段上
    return (t.x<=max(a.x, b.x)&&
            t.x>=min(a.x, b.x)&&
            t.y<=max(a.y, b.y)&&
            t.y>=min(a.y, b.y)&&
            fabs(x_mult(t, a, b))<EP);
}

bool Point_In_Polygon(Point pt){                        //判断点在多边形内（包括边界）
    int i, num=0;
    for(i=0; i<n; i++){
        Point p1=p[i], p2=p[i+1];
        if(Point_In_Segment(p1, p2, pt))return true;
        if(p1.y==p2.y||pt.y<min(p1.y, p2.y)||pt.y>=max(p1.y, p2.y))
        continue;
        double t=(pt.y-p1.y)*(p2.x-p1.x)/(p2.y-p1.y)+p1.x;
        if(t>pt.x)num++;
    }
    return num&1;
}
double Linelenth_In_Polygon(Line l1){        //判断直线在多边形内长度（包括边界）
    int i;
    double ans=0;
    Point mid;
    p[n]=p[0];
    cnt=0;
    for(i=0; i<n; i++){
        if(x_mult(p[i], l1.a, l1.b)*x_mult(p[i+1], l1.a, l1.b)<EP){   //如果边上的不算，改为-EP
            if(fabs(x_mult(p[i], l1.a, l1.b))<EP&&
				fabs(x_mult(p[i+1], l1.a, l1.b))<EP)  //重合时无交点处理
				continue;
            tp[cnt++]=intersection(p[i], p[i+1], l1.a, l1.b);
        }
    }
	if(fabs(l1.a.x-l1.b.x)>EP)      //选择按x还是y排序，防止平行坐标轴时精度问题
	sort(tp, tp+cnt, cmpx);
	else sort(tp, tp+cnt, cmpy);
    for(i=0; i<cnt-1; i++){
        mid.x=(tp[i].x+tp[i+1].x)/2;
        mid.y=(tp[i].y+tp[i+1].y)/2;
        if(Point_In_Polygon(mid))
        ans+=dist(tp[i], tp[i+1]);
    }
    return ans;
}
void read(){
    int i;
    Line l1;
    for(i=0; i<n; i++)
        scanf("%lf%lf", &p[i].x, &p[i].y);
    for(i=0; i<m; i++){
        scanf("%lf%lf%lf%lf", &l1.a.x, &l1.a.y, &l1.b.x, &l1.b.y);
        printf("%.3f\n", Linelenth_In_Polygon(l1));
    }
}

int main(){
    //freopen("1.txt", "r", stdin);
    while(scanf("%d%d", &n, &m)&&(n+m)){
        read();
    }
    return 0;
}