裸半平面交
#include<iostream>
#include <stdio.h>
#include <math.h>
#define eps 1e-8
using namespace std;
const int MAXN=210;
int m;
double r;
int cCnt,curCnt;//此时cCnt为最终切割得到的多边形的顶点数、暂存顶点个数
struct point
{
double x,y;
};
point points[MAXN],p[MAXN],q[MAXN];//读入的多边形的顶点(顺时针)、p为存放最终切割得到的多边形顶点的数组、暂存核的顶点
void getline(point x,point y,double &a,double &b,double &c) //两点x、y确定一条直线a、b、c为其系数
{
a = y.y - x.y;
b = x.x - y.x;
c = y.x * x.y - x.x * y.y;
}
void initial()
{
for(int i = 1; i <= m; ++i)p[i] = points[i];
p[m+1] = p[1];
p[0] = p[m];
cCnt = m;//cCnt为最终切割得到的多边形的顶点数,将其初始化为多边形的顶点的个数
}
point intersect(point x,point y,double a,double b,double c) //求x、y形成的直线与已知直线a、b、c、的交点
{
double u = fabs(a * x.x + b * x.y + c);
double v = fabs(a * y.x + b * y.y + c);
point pt;
pt.x=(x.x * v + y.x * u) / (u + v);
pt.y=(x.y * v + y.y * u) / (u + v);
return pt;
}
void cut(double a,double b ,double c)
{
curCnt = 0;
for(int i = 1; i <= cCnt; ++i)
{
if(a*p[i].x + b*p[i].y + c >= 0)q[++curCnt] = p[i];// c由于精度问题,可能会偏小,所以有些点本应在右侧而没在,
//故应该接着判断
else
{
if(a*p[i-1].x + b*p[i-1].y + c > 0) //如果p[i-1]在直线的右侧的话,
{
//则将p[i],p[i-1]形成的直线与已知直线的交点作为核的一个顶点(这样的话,由于精度的问题,核的面积可能会有所减少)
q[++curCnt] = intersect(p[i],p[i-1],a,b,c);
}
if(a*p[i+1].x + b*p[i+1].y + c > 0) //原理同上
{
q[++curCnt] = intersect(p[i],p[i+1],a,b,c);
}
}
}
for(int i = 1; i <= curCnt; ++i)p[i] = q[i];//将q中暂存的核的顶点转移到p中
p[curCnt+1] = q[1];
p[0] = p[curCnt];
cCnt = curCnt;
}
int dcmp(double x)
{
if(fabs(x)<eps) return 0;
else return x<0?-1:1;
}
void solve()
{
//注意:默认点是顺时针,如果题目不是顺时针,规整化方向
initial();
for(int i = 1; i <= m; ++i)
{
double a,b,c;
getline(points[i],points[i+1],a,b,c);
cut(a,b,c);
}
/*
如果要向内推进r,用该部分代替上个函数
for(int i = 1; i <= m; ++i){
Point ta, tb, tt;
tt.x = points[i+1].y - points[i].y;
tt.y = points[i].x - points[i+1].x;
double k = r / sqrt(tt.x * tt.x + tt.y * tt.y);
tt.x = tt.x * k;
tt.y = tt.y * k;
ta.x = points[i].x + tt.x;
ta.y = points[i].y + tt.y;
tb.x = points[i+1].x + tt.x;
tb.y = points[i+1].y + tt.y;
double a,b,c;
getline(ta,tb,a,b,c);
cut(a,b,c);
}*/
//多边形核的面积
double area = 0;
for(int i = 1; i <= curCnt; ++i)
area += p[i].x * p[i + 1].y - p[i + 1].x * p[i].y;
area = fabs(area / 2.0);
if(!curCnt&&dcmp(area)==0)
puts("Surveillance is impossible.");
else
puts("Surveillance is possible.");
}
/*void GuiZhengHua(){
//规整化方向,逆时针变顺时针,顺时针变逆时针
for(int i = 1; i < (m+1)/2; i ++)
swap(points[i], points[m-i]);
}*/
int main()
{
int kk = 0;
while(scanf("%d",&m)&&m)
{
int i;
for(i=1; i<=m; i++)
cin>>points[i].x>>points[i].y;
points[m+1]=points[1];
printf("Floor #%d\n",++kk);
solve();
puts("");
}
}
poj 3335
#include<iostream>
#include <stdio.h>
#include <math.h>
#define eps 1e-8
using namespace std;
const int MAXN=210;
int m;
double r;
int cCnt,curCnt;//此时cCnt为最终切割得到的多边形的顶点数、暂存顶点个数
struct point
{
double x,y;
};
point points[MAXN],p[MAXN],q[MAXN];//读入的多边形的顶点(顺时针)、p为存放最终切割得到的多边形顶点的数组、暂存核的顶点
void getline(point x,point y,double &a,double &b,double &c) //两点x、y确定一条直线a、b、c为其系数
{
a = y.y - x.y;
b = x.x - y.x;
c = y.x * x.y - x.x * y.y;
}
void initial()
{
for(int i = 1; i <= m; ++i)p[i] = points[i];
p[m+1] = p[1];
p[0] = p[m];
cCnt = m;//cCnt为最终切割得到的多边形的顶点数,将其初始化为多边形的顶点的个数
}
point intersect(point x,point y,double a,double b,double c) //求x、y形成的直线与已知直线a、b、c、的交点
{
double u = fabs(a * x.x + b * x.y + c);
double v = fabs(a * y.x + b * y.y + c);
point pt;
pt.x=(x.x * v + y.x * u) / (u + v);
pt.y=(x.y * v + y.y * u) / (u + v);
return pt;
}
void cut(double a,double b ,double c)
{
curCnt = 0;
for(int i = 1; i <= cCnt; ++i)
{
if(a*p[i].x + b*p[i].y + c >= 0)q[++curCnt] = p[i];// c由于精度问题,可能会偏小,所以有些点本应在右侧而没在,
//故应该接着判断
else
{
if(a*p[i-1].x + b*p[i-1].y + c > 0) //如果p[i-1]在直线的右侧的话,
{
//则将p[i],p[i-1]形成的直线与已知直线的交点作为核的一个顶点(这样的话,由于精度的问题,核的面积可能会有所减少)
q[++curCnt] = intersect(p[i],p[i-1],a,b,c);
}
if(a*p[i+1].x + b*p[i+1].y + c > 0) //原理同上
{
q[++curCnt] = intersect(p[i],p[i+1],a,b,c);
}
}
}
for(int i = 1; i <= curCnt; ++i)p[i] = q[i];//将q中暂存的核的顶点转移到p中
p[curCnt+1] = q[1];
p[0] = p[curCnt];
cCnt = curCnt;
}
int dcmp(double x)
{
if(fabs(x)<eps) return 0;
else return x<0?-1:1;
}
void solve()
{
//注意:默认点是顺时针,如果题目不是顺时针,规整化方向
initial();
for(int i = 1; i <= m; ++i)
{
double a,b,c;
getline(points[i],points[i+1],a,b,c);
cut(a,b,c);
}
/*
如果要向内推进r,用该部分代替上个函数
for(int i = 1; i <= m; ++i){
Point ta, tb, tt;
tt.x = points[i+1].y - points[i].y;
tt.y = points[i].x - points[i+1].x;
double k = r / sqrt(tt.x * tt.x + tt.y * tt.y);
tt.x = tt.x * k;
tt.y = tt.y * k;
ta.x = points[i].x + tt.x;
ta.y = points[i].y + tt.y;
tb.x = points[i+1].x + tt.x;
tb.y = points[i+1].y + tt.y;
double a,b,c;
getline(ta,tb,a,b,c);
cut(a,b,c);
}*/
//多边形核的面积
double area = 0;
for(int i = 1; i <= curCnt; ++i)
area += p[i].x * p[i + 1].y - p[i + 1].x * p[i].y;
area = fabs(area / 2.0);
if(!curCnt&&dcmp(area)==0)
puts("NO");
else
puts("YES");
}
/*void GuiZhengHua(){
//规整化方向,逆时针变顺时针,顺时针变逆时针
for(int i = 1; i < (m+1)/2; i ++)
swap(points[i], points[m-i]);
}*/
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&m);
int i;
for(i=1; i<=m; i++)
cin>>points[i].x>>points[i].y;
points[m+1]=points[1];
solve();
}
}
poj 1279
#include<iostream> #include <cstdio> #include <cmath> #define eps 1e-8 using namespace std; const int MAXN=1510; int m; double r; int cCnt,curCnt;//此时cCnt为最终切割得到的多边形的顶点数、暂存顶点个数 struct point { double x,y; }; point points[MAXN],p[MAXN],q[MAXN];//读入的多边形的顶点(顺时针)、p为存放最终切割得到的多边形顶点的数组、暂存核的顶点 void getline(point x,point y,double &a,double &b,double &c) //两点x、y确定一条直线a、b、c为其系数 { a = y.y - x.y; b = x.x - y.x; c = y.x * x.y - x.x * y.y; } void initial() { for(int i = 1; i <= m; ++i)p[i] = points[i]; p[m+1] = p[1]; p[0] = p[m]; cCnt = m;//cCnt为最终切割得到的多边形的顶点数,将其初始化为多边形的顶点的个数 } point intersect(point x,point y,double a,double b,double c) //求x、y形成的直线与已知直线a、b、c、的交点 { double u = fabs(a * x.x + b * x.y + c); double v = fabs(a * y.x + b * y.y + c); point pt; pt.x=(x.x * v + y.x * u) / (u + v); pt.y=(x.y * v + y.y * u) / (u + v); return pt; } void cut(double a,double b ,double c) { curCnt = 0; for(int i = 1; i <= cCnt; ++i) { if(a*p[i].x + b*p[i].y + c >= 0)q[++curCnt] = p[i];// c由于精度问题,可能会偏小,所以有些点本应在右侧而没在, //故应该接着判断 else { if(a*p[i-1].x + b*p[i-1].y + c > 0) //如果p[i-1]在直线的右侧的话, { //则将p[i],p[i-1]形成的直线与已知直线的交点作为核的一个顶点(这样的话,由于精度的问题,核的面积可能会有所减少) q[++curCnt] = intersect(p[i],p[i-1],a,b,c); } if(a*p[i+1].x + b*p[i+1].y + c > 0) //原理同上 { q[++curCnt] = intersect(p[i],p[i+1],a,b,c); } } } for(int i = 1; i <= curCnt; ++i)p[i] = q[i];//将q中暂存的核的顶点转移到p中 p[curCnt+1] = q[1]; p[0] = p[curCnt]; cCnt = curCnt; } int dcmp(double x) { if(fabs(x)<eps) return 0; else return x<0?-1:1; } void solve() { //注意:默认点是顺时针,如果题目不是顺时针,规整化方向 initial(); for(int i = 1; i <= m; ++i) { double a,b,c; getline(points[i],points[i+1],a,b,c); cut(a,b,c); } /* 如果要向内推进r,用该部分代替上个函数 for(int i = 1; i <= m; ++i){ Point ta, tb, tt; tt.x = points[i+1].y - points[i].y; tt.y = points[i].x - points[i+1].x; double k = r / sqrt(tt.x * tt.x + tt.y * tt.y); tt.x = tt.x * k; tt.y = tt.y * k; ta.x = points[i].x + tt.x; ta.y = points[i].y + tt.y; tb.x = points[i+1].x + tt.x; tb.y = points[i+1].y + tt.y; double a,b,c; getline(ta,tb,a,b,c); cut(a,b,c); }*/ //多边形核的面积 double area = 0; for(int i = 1; i <= curCnt; ++i) area += p[i].x * p[i + 1].y - p[i + 1].x * p[i].y; area = fabs(area / 2.0); printf("%.2f\n",area); } /*void GuiZhengHua(){ //规整化方向,逆时针变顺时针,顺时针变逆时针 for(int i = 1; i < (m+1)/2; i ++) swap(points[i], points[m-i]); }*/ int main() { int t; scanf("%d",&t); while(t--) { scanf("%d",&m); int i; for(i=1; i<=m; i++) cin>>points[i].x>>points[i].y; points[m+1]=points[1]; solve(); } }
变化题型
1.求在多边形中画一个圆的最大半径
2。半平面交判断不等式是否有解。注意特殊情况
POJ 3525 Most Distant Point from the Sea (推荐)
求在多边形中画一个圆的最大半径
可以使用半平面交+ 二分法解。对每个距离进行判定(是否存在区域可以放置圆心,多边形的的每条边向内推进
#include<iostream>
#include <cstdio>
#include <cmath>
#define eps 1e-8
using namespace std;
const int MAXN=1510;
int m;
double r;
int cCnt,curCnt;//此时cCnt为最终切割得到的多边形的顶点数、暂存顶点个数
struct point
{
double x,y;
};
point points[MAXN],p[MAXN],q[MAXN];//读入的多边形的顶点(顺时针)、p为存放最终切割得到的多边形顶点的数组、暂存核的顶点
void getline(point x,point y,double &a,double &b,double &c) //两点x、y确定一条直线a、b、c为其系数
{
a = y.y - x.y;
b = x.x - y.x;
c = y.x * x.y - x.x * y.y;
}
void initial()
{
for(int i = 1; i <= m; ++i)p[i] = points[i];
p[m+1] = p[1];
p[0] = p[m];
cCnt = m;//cCnt为最终切割得到的多边形的顶点数,将其初始化为多边形的顶点的个数
}
point intersect(point x,point y,double a,double b,double c) //求x、y形成的直线与已知直线a、b、c、的交点
{
double u = fabs(a * x.x + b * x.y + c);
double v = fabs(a * y.x + b * y.y + c);
point pt;
pt.x=(x.x * v + y.x * u) / (u + v);
pt.y=(x.y * v + y.y * u) / (u + v);
return pt;
}
void cut(double a,double b ,double c)
{
curCnt = 0;
for(int i = 1; i <= cCnt; ++i)
{
if(a*p[i].x + b*p[i].y + c >= 0)q[++curCnt] = p[i];// c由于精度问题,可能会偏小,所以有些点本应在右侧而没在,
//故应该接着判断
else
{
if(a*p[i-1].x + b*p[i-1].y + c > 0) //如果p[i-1]在直线的右侧的话,
{
//则将p[i],p[i-1]形成的直线与已知直线的交点作为核的一个顶点(这样的话,由于精度的问题,核的面积可能会有所减少)
q[++curCnt] = intersect(p[i],p[i-1],a,b,c);
}
if(a*p[i+1].x + b*p[i+1].y + c > 0) //原理同上
{
q[++curCnt] = intersect(p[i],p[i+1],a,b,c);
}
}
}
for(int i = 1; i <= curCnt; ++i)p[i] = q[i];//将q中暂存的核的顶点转移到p中
p[curCnt+1] = q[1];
p[0] = p[curCnt];
cCnt = curCnt;
}
int dcmp(double x)
{
if(fabs(x)<eps) return 0;
else return x<0?-1:1;
}
int solve(double r)
{
//注意:默认点是顺时针,如果题目不是顺时针,规整化方向
initial();
/*for(int i = 1; i <= m; ++i)
{
double a,b,c;
getline(points[i],points[i+1],a,b,c);
cut(a,b,c);
}*/
// 如果要向内推进r,用该部分代替上个函数
for(int i = 1; i <= m; ++i){
point ta, tb, tt;
tt.x = points[i+1].y - points[i].y;
tt.y = points[i].x - points[i+1].x;
double k = r / sqrt(tt.x * tt.x + tt.y * tt.y);
tt.x = tt.x * k;
tt.y = tt.y * k;
ta.x = points[i].x + tt.x;
ta.y = points[i].y + tt.y;
tb.x = points[i+1].x + tt.x;
tb.y = points[i+1].y + tt.y;
double a,b,c;
getline(ta,tb,a,b,c);
cut(a,b,c);
}
//多边形核的面积
/*double area = 0;
for(int i = 1; i <= curCnt; ++i)
area += p[i].x * p[i + 1].y - p[i + 1].x * p[i].y;
area = fabs(area / 2.0);
printf("%.2f\n",area);*/
if(cCnt<=0)return 0;
return 1;
}
void GuiZhengHua(){
//规整化方向,逆时针变顺时针,顺时针变逆时针
for(int i = 1; i < (m+1)/2; i ++)
swap(points[i], points[m-i]);
}
int main()
{
//int t;
//scanf("%d",&t);
while(scanf("%d",&m)&&m)
{
int i;
for(i=1; i<=m; i++)
cin>>points[i].x>>points[i].y;
GuiZhengHua();points[m+1]=points[1];
double high=10000;
double low=0;
double mid;
while(low+eps<=high){
mid=(low+high)/2.0;
if(solve(mid)==1){
low=mid+0.0000001;
}
else{
high=mid-0.0000001;
}
}
printf("%.6f\n",high);
}
return 0;
}
POJ 1755 Triathlon (推荐)
半平面交判断不等式是否有解。注意特殊情况
#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<sstream>
#include<cassert>
#define LL long long
#define eps 1e-5
#define inf 1<<30
using namespace std;
struct Point{
double x,y;
}p[1505],tp[1505],q[1505];
double dist(Point p1,Point p2){
return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}
//叉积
double xmul(Point p0,Point p1,Point p2){
return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
//通过两点,确定直线方程
double Get_equation(Point p1,Point p2,double &a,double &b,double &c){
a=p2.y-p1.y;
b=p1.x-p2.x;
c=p2.x*p1.y-p1.x*p2.y;
}
//求交点
Point Intersection(Point p1,Point p2,double a,double b,double c){
double u=fabs(a*p1.x+b*p1.y+c);
double v=fabs(a*p2.x+b*p2.y+c);
Point t;
t.x=(p1.x*v+p2.x*u)/(u+v);t.y=(p1.y*v+p2.y*u)/(u+v);
return t;
}
//求面积,正为顺时针,和叉积写法有关
double Get_area(Point p[],int n){
double area=0;
for(int i=2;i<n;i++)
area+=xmul(p[1],p[i],p[i+1]);
return -area/2.0;
}
//改变顺序
double Change_dir(Point p[],int n){
for(int i=1;i<=n/2;i++)
swap(p[i],p[n+1-i]);
}
//加入一条边,切割
void Cut(double a,double b,double c,Point p[],int &cnt){
int tmp=0;
for(int i=1;i<=cnt;i++){
//当前点就在右侧
if(a*p[i].x+b*p[i].y+c>-eps) tp[++tmp]=p[i];
else{
//前一个点在右侧,产生交点
if(a*p[i-1].x+b*p[i-1].y+c>eps)
tp[++tmp]=Intersection(p[i-1],p[i],a,b,c);
//同理
if(a*p[i+1].x+b*p[i+1].y+c>eps)
tp[++tmp]=Intersection(p[i],p[i+1],a,b,c);
}
}
for(int i=1;i<=tmp;i++)
p[i]=tp[i];
p[0]=p[tmp];p[tmp+1]=p[1];
cnt=tmp;
}
int slove(Point q[],int n,double r){
//默认顺时针,通过面积判断一下
if(Get_area(q,n)<eps) Change_dir(q,n);
q[0]=q[n];q[n+1]=q[1];
//原来的点要备份一遍,查了好久
for(int i=0;i<=n+1;i++) p[i]=q[i];
int cnt=n;
for(int i=1;i<=n;i++){
double a,b,c;
Point p1,p2,p3;
p1.y=q[i].x-q[i+1].x;p1.x=q[i+1].y-q[i].y;
double k=r/sqrt(p1.x*p1.x+p1.y*p1.y);
p1.x=k*p1.x;p1.y=p1.y*k;
p2.x=p1.x+q[i].x;p2.y=p1.y+q[i].y;
p3.x=p1.x+q[i+1].x;p3.y=p1.y+q[i+1].y;
Get_equation(p2,p3,a,b,c);
Cut(a,b,c,p,cnt);
}
double maxdist=0;
Point p1,p2;
for(int i=1;i<=cnt;i++)
for(int j=1;j<=cnt;j++){
double d=dist(p[i],p[j]);
if(d+eps>maxdist){
maxdist=d;
p1=p[i];
p2=p[j];
}
}
printf("%.4f %.4f %.4f %.4f\n",p1.x,p1.y,p2.x,p2.y);
}
int main(){
int n,r;
while( scanf("%d%d",&n,&r)!=EOF){
for(int i=1;i<=n;i++)
scanf("%lf%lf",&q[i].x,&q[i].y);
slove(q,n,r);
}
return 0;
}