POJ 3130-How I Mathematician Wonder What You Are!(計算幾何-星形-半平面交逆時針模板)
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 3730 | Accepted: 2007 |
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 x1 y1 x2 y2 …
xn yn
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 ≤ xi ≤ 10000 and 0 ≤ yi ≤ 10000 (i = 1, …, n). Line segments (xi, yi)–(xi + 1, yi + 1) (i = 1, …, n − 1) and the line segment (xn, yn)–(x1, y1) 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
6 66 13 96 61 76 98 13 94 4 0 45 68 8 27 21 55 14 93 12 56 95 15 48 38 46 51 65 64 31 0
Sample Output
1 0
Source
#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
#define INF 0xfffffff
#define MAXN 275000
const double eps=1e-8;
const int maxn=105;
int dq[maxn],top,bot,pn,order[maxn],ln;
struct Point
{
double x,y;
} p[maxn];
struct Line
{
Point a,b;
double angle;
} l[maxn];
int dblcmp(double k)
{
if(fabs(k)<eps) return 0;
return k>0?1:-1;
}
double multi(Point p0,Point p1,Point p2)
{
return (p1.x-p0.x)*(p2.y-p0.y)-(p1.y-p0.y)*(p2.x-p0.x);
}
bool cmp(int u,int v)
{
int d=dblcmp(l[u].angle-l[v].angle);
if (!d) return dblcmp(multi(l[u].a,l[v].a,l[v].b))>0;//大於0取向量左半部分為半平面,小於0,取右半部分
return d<0;
}
void getIntersect(Line l1,Line l2,Point& p)
{
double dot1,dot2;
dot1=multi(l2.a,l1.b,l1.a);
dot2=multi(l1.b,l2.b,l1.a);
p.x=(l2.a.x*dot2+l2.b.x*dot1)/(dot2+dot1);
p.y=(l2.a.y*dot2+l2.b.y*dot1)/(dot2+dot1);
}
bool judge(Line l0,Line l1,Line l2)
{
Point p;
getIntersect(l1,l2,p);
return dblcmp(multi(p,l0.a,l0.b))<0;//大於小於符號與上面cmp()中註釋處相反
}
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].angle=atan2(y2-y1,x2-x1);
order[ln]=ln;
ln++;
}
void halfPlaneIntersection()
{
sort(order,order+ln,cmp);
int j=0;
for(int i=1; i<ln; i++)
if(dblcmp(l[order[i]].angle-l[order[j]].angle)>0)
order[++j]=order[i];
ln=j+1;
dq[0]=order[0];
dq[1]=order[1];
bot=0;
top=1;
for(int i=2; i<ln; i++)
{
while(bot<top&&judge(l[order[i]],l[dq[top-1]],l[dq[top]])) top--;
while(bot<top&&judge(l[order[i]],l[dq[bot+1]],l[dq[bot]])) bot++;
dq[++top]=order[i];
}
while(bot<top&&judge(l[dq[bot]],l[dq[top-1]],l[dq[top]])) top--;
while(bot<top&&judge(l[dq[top]],l[dq[bot+1]],l[dq[bot]])) bot++;
}
bool isThereACore()
{
if (top-bot>1) return true;
return false;
}
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("G:/cbx/read.txt","r",stdin);
//freopen("G:/cbx/out.txt","w",stdout);
#endif
while(~scanf("%d",&pn))
{
if(pn==0) break;
ln=0;
for(int i=0; i<pn; i++)
scanf("%lf%lf",&p[i].x,&p[i].y);
for(int i=0; i<pn-1; i++)
addLine(p[i].x,p[i].y,p[i+1].x,p[i+1].y);
addLine(p[pn-1].x,p[pn-1].y,p[0].x,p[0].y);
halfPlaneIntersection();
if(isThereACore()) printf("1\n");
else printf("0\n");
}
return 0;
}
相關文章
- 計算幾何:模板
- 計算幾何模板
- POJ - 1556 【計算幾何 + 最短路】
- POJ 1113 Wall(思維 計算幾何 數學)
- 計算幾何
- Something about 計算幾何
- [筆記] 計算幾何筆記
- What You See Is What You Get 所見即所得 20240525~0526 心得記錄
- 計算幾何 —— 二維幾何基礎 —— 距離度量方法
- What you should know about JavaJava
- SGU 124 Broken line(計算幾何)
- 計算幾何——平面最近點對
- 【學習筆記】計算幾何筆記
- 邊緣計算、霧計算、雲端計算區別幾何?
- BNUOJ 12887 isumi(計算幾何+最大流)
- SGU 120 SGU 228 Archipelago(計算幾何)Go
- Unlearn What You Want to Forget Efficient Unlearning for LLMs
- 計算幾何(一):凸包問題(Convex Hull)
- Look what I found out.
- HNOI2016礦區(計算幾何+對偶圖)
- 計算機視覺—圖片幾何變換(2)計算機視覺
- PostgreSQL DBA(75) - Locks(locktype:transactionid):What You Should KnowSQL
- PostgreSQL DBA(76) - Locks(Advisory Locks):What You Should KnowSQL
- PostgreSQL DBA(44) - Privileges & User Management - What You Should KnowSQL
- sql server 計算兩個時間 相差的 幾天幾時幾分幾秒SQLServer
- 逆波蘭計算器
- BZOJ 4445 [Scoi2015]小凸想跑步:半平面交
- 平時程式碼中用不到設計模式?Are you kidding me?設計模式
- what-i-learned-from-analysis-vuepressVue
- CodeForces 887 E. Little Brother(計算幾何+二分)
- PostgreSQL DBA(74) - Locks(Row-Level):What You Should KnowSQL
- PostgreSQL DBA(71) - Locks(Table-Level):What You Should KnowSQL
- [計算幾何]圓與三角形是否相交
- 計算機I/O與I/O模型計算機模型
- 百度造車,勝算幾何?
- 實時計算既有Flink,為何又推出個StreamPark?
- [幾何]計算不規則多邊形的面積、中心、重心
- 在量子計算時代,企業資料的加密該何去何從?加密
- Flink實時計算pv、uv的幾種方法