poj 3130 How I Mathematician Wonder What You Are!

最新推荐文章于 2019-09-17 16:21:31 发布

我要吃熊猫

最新推荐文章于 2019-09-17 16:21:31 发布

阅读量407

点赞数

分类专栏：半平面交

本文链接：https://blog.csdn.net/chai_jing/article/details/72779957

版权

半平面交专栏收录该内容

6 篇文章 0 订阅

订阅专栏

How I Mathematician Wonder What You Are!

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 3773		Accepted: 2025

Description

After counting so many stars in the sky in his childhood, Isaac, now an astronomer and a mathematician uses a big astronomical telescope and lets his image processing program count stars. The hardest part of the program is to judge if shining object in the sky is really a star. As a mathematician, the only way he knows is to apply a mathematical definition of stars.

The mathematical definition of a star shape is as follows: A planar shape F is star-shaped if and only if there is a point C ∈ F such that, for any point P ∈ F, the line segment CP is contained in F. Such a point C is called a center of F. To get accustomed to the definition let’s see some examples below.

The first two are what you would normally call stars. According to the above definition, however, all shapes in the first row are star-shaped. The two in the second row are not. For each star shape, a center is indicated with a dot. Note that a star shape in general has infinitely many centers. Fore Example, for the third quadrangular shape, all points in it are centers.

Your job is to write a program that tells whether a given polygonal shape is star-shaped or not.

Input

The input is a sequence of datasets followed by a line containing a single zero. Each dataset specifies a polygon, and is formatted as follows.

n
x₁ y₁
x₂ y₂

…

x_n y_n

The first line is the number of vertices, n, which satisfies 4 ≤ n ≤ 50. Subsequent n lines are the x- and y-coordinates of the n vertices. They are integers and satisfy 0 ≤ x_i ≤ 10000 and 0 ≤ y_i ≤ 10000 (i = 1, …, n). Line segments (x_i, y_i)–(x_i_{+ 1}, y_i_{+ 1}) (i = 1, …, n − 1) and the line segment (x_n, y_n)–(x₁, y₁) form the border of the polygon in the counterclockwise order. That is, these line segments see the inside of the polygon in the left of their directions.

You may assume that the polygon is simple, that is, its border never crosses or touches itself. You may assume assume that no three edges of the polygon meet at a single point even when they are infinitely extended.

Output

For each dataset, output “1” if the polygon is star-shaped and “0” otherwise. Each number must be in a separate line and the line should not contain any other characters.

Sample Input

Sample Output

1
0

Source

Japan 2006

【分析】

半平面交第一题...O(nlogn)

貌似是先极角排序，然后斜率相同的点用叉积判一下取靠左边的直线。

然后一个一个扔到双端队列，如果新加入的直线被原来的某条直线构成的半平面覆盖掉，那么把某直线弹出队列。

最后YY一下，半平面交是一个凸包？队列里的元素个数k即代表凸包是k边形。

如果k>=3那么ans=true。

【代码】

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#define ll long long
#define M(a) memset(a,0,sizeof a)
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std;
const double eps=1e-8;
const int mxn=55;
int h,t,pn,ln,n;
int order[mxn],deque[mxn];
struct point {double x,y;} p[mxn];
struct line {point a,b;double ang;} l[mxn];
inline int dbcomp(double k) 
{
	if(fabs(k)<eps) return 0;
	return k>0?1:-1;
}
inline double mul(point p0,point p1,point p2)
{
	return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
inline bool comp(int u,int v)
{
	int d=dbcomp(l[u].ang-l[v].ang);
	if(!d) return dbcomp(mul(l[u].a,l[v].a,l[v].b))>0;
	return d<0;
}
inline void addline(double x1,double y1,double x2,double y2)
{
	l[ln].a.x=x1,l[ln].a.y=y1;
	l[ln].b.x=x2,l[ln].b.y=y2;
	l[ln].ang=atan2(y2-y1,x2-x1);
	order[ln]=ln,ln++;
}
inline void get(line l1,line l2,point &p)
{
	double d1,d2;
	d1=mul(l2.a,l1.b,l1.a);
	d2=mul(l1.b,l2.b,l1.a);
	p.x=(l2.a.x*d2+l2.b.x*d1)/(d1+d2);
	p.y=(l2.a.y*d2+l2.b.y*d1)/(d1+d2);
}
inline bool judge(line l0,line l1,line l2)
{
	point p;
	get(l1,l2,p);
	return dbcomp(mul(p,l0.a,l0.b))<0;
}
inline void HPI()
{
	int i,j;
	sort(order,order+ln,comp);
	for(i=1,j=0;i<ln;i++)
	  if(dbcomp(l[order[i]].ang-l[order[j]].ang)>0)
	    order[++j]=order[i];
	ln=j+1;
	deque[0]=order[0];
	deque[1]=order[1];
	h=0,t=1;
	for(i=2;i<ln;i++)
	{
		while(h<t && judge(l[order[i]],l[deque[t-1]],l[deque[t]])) t--;
		while(h<t && judge(l[order[i]],l[deque[h+1]],l[deque[h]])) h++;
		deque[++t]=order[i];
	}
	while(h<t && judge(l[order[h]],l[deque[t-1]],l[deque[t]])) t--;
	while(h<t && judge(l[order[t]],l[deque[h+1]],l[deque[h]])) h++;
}
int main()
{
	int i,j;
	while(scanf("%d",&n) && n)
	{
		fo(i,0,n-1)
		  scanf("%lf%lf",&p[i].x,&p[i].y);
		for(ln=i=0;i<n-1;i++)
		  addline(p[i].x,p[i].y,p[i+1].x,p[i+1].y);
		addline(p[i].x,p[i].y,p[0].x,p[0].y);
		HPI();
		if(t-h>1) printf("1\n");
		else printf("0\n");
	}
	return 0;
}