PKU 3525 Most Distant Point from the Sea

 

Most Distant Point from the Sea

Description

The main land of Japan called Honshu is an island surrounded by the sea. In such an island, it is natural to ask a question: “Where is the most distant point from the sea?” The answer to this question for Honshu was found in 1996. The most distant point is located in former Usuda Town, Nagano Prefecture, whose distance from the sea is 114.86 km.

日本的最主要的岛屿是Honshu ，它被大海包围着，作为一个岛屿，很自然的想问：距离海最远的点在哪里，答案在1996年已经找到….

In this problem, you are asked to write a program which, given a map of an island, finds the most distant point from the sea in the island, and reports its distance from the sea. In order to simplify the problem, we only consider maps representable by convex polygons.

在这个问题中，你需要写一个程序，找到距离海边最远的点，并且计算出它距离海的距离。为了简化问题，我们只考虑海岛的形状是一个凸包的情况。

Input

The input consists of multiple datasets. Each dataset represents a map of an island, which is a convex polygon. The format of a dataset is as follows.

包括多组测试数据，每组数据代表一个海岛的形状，并且形状是一个凸包，下面是一组数据的输入举例。

n
x1		y1
	⋮
xn		yn

Every input item in a dataset is a non-negative integer. Two input items in a line are separated by a space.

输入的每个数都是非负的整数，两个数在一行时用空格隔开。

n in the first line is the number of vertices of the polygon, satisfying 3 ≤ n ≤ 100. Subsequent n lines are the x- and y-coordinates of the n vertices. Line segments (x_i,y_i)–(x_i+1, y_i+1) (1 ≤ i ≤ n − 1) and the line segment (x_n, y_n)–(x₁, y₁) form the border of the polygon in counterclockwise order. That is, these line segments see the inside of the polygon in the left of their directions. All coordinate values are between 0 and 10000, inclusive.

n在第一行，表示凸包有n个顶点， （3<=n<=100）.随后的n行表示n个顶点，点序列组成一个逆时针的凸包，0<=xi,yi<=10000

You can assume that the polygon is simple, that is, its border never crosses or touches itself. As stated above, the given polygon is always a convex one

每个多边形都是简单的，即边部相交。并且都是凸包。

The last dataset is followed by a line containing a single zero.

最后一行是一个数0，表示解释。

Output

For each dataset in the input, one line containing the distance of the most distant point from the sea should be output. An output line should not contain extra characters such as spaces. The answer should not have an error greater than 0.00001 (10⁻⁵). You may output any number of digits after the decimal point, provided that the above accuracy condition is satisfied.

对于每组测试数据，输出一行，包括距离海岸最远的点到海岸的距离。输出不要包括其他的字符比如空格。精度保持到0.00001，你可以在精度后输出任何数，但是要保证精度不受影响。

Sample Input

4

0 0

10000 0

10000 10000

0 10000

3

0 0

10000 0

7000 1000

6

0 40

100 20

250 40

250 70

100 90

0 70

3

0 0

10000 10000

5000 5001

0

Sample Output

5000.000000

494.233641

34.542948

0.353553

 

 

解题思路：

         求凸包中的一点时其到任意边的距离最远。

         显然：一条直线与一凸包求半平面交，结果任然是一个凸包。

        

         将每条边看做一条直线，然后，将一条边l向凸包内的方向平移一段“适当的距离s”得到新的直线L，然后求L与凸包的交得到新的凸包，将每条边都移动s的距离，

如果最后得到一个点或者一条直线，那么这个“适当的距离”就是所求的距离。距离海岸最远的点就是最后得到的点或者直线。

如果得到的是空，那么s距离大了；

如果得到的任是一个凸包，那么s 小了。

 

         我们可以枚举这个适当距离，这里说明我们枚举的次数是很少的，只是一个32以内的常数次。因为2^32=4 0000 0000；9位数，这里数值的有效位数最大也为9，即证。

 #include<iostream> #include<algorithm> #include<cmath> #include<stdio.h> using namespace std; const double eps=1.0e-6; const int N=105; typedef struct{double x,y;}point; point p[N],t[N]; int n,m; int dblcmp(double x) { if(fabs(x)<eps) return 0; return x>0?1:-1; } double crossleft(point a,point b,point c) { return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y); } double distances(point a,point b) { return sqrt( (b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y) ); } point intersection(point a,point b,point c,point d) { double k,s1,s2; point ff,tt; ff.x=b.x-(a.x-d.x); ff.y=b.y-(a.y-d.y); s1=crossleft(a,b,c); s2=crossleft(d,ff,c); k=s1/s2; tt.x=c.x+k*(d.x-c.x); tt.y=c.y+k*(d.y-c.y); return tt; } //将直线ab按 向量ab的逆时针方向平移 s 的距离，结果保留在t1，t2中； void translation(point a,point b,double s,point& t1,point& t2) { if(dblcmp(a.x-b.x)==0) { t1.y=a.y; t1.x=a.x-s; } else if(dblcmp(a.y-b.y)==0) { t1.x=a.x; t1.y=a.y+s; } else { point t; t.x=b.x; t.y=(t.x-a.x)*(b.x-a.x)/(a.y-b.y)+a.y; double at; at=distances(a,t); t1.x=s/at*(t.x-a.x)+a.x; t1.y=s/at*(t.y-a.y)+a.y; } if(dblcmp(crossleft(a,b,t1))<0) { t1.x=2*a.x-t1.x; t1.y=2*a.y-t1.y; } t2.x=b.x-a.x+t1.x; t2.y=b.y-a.y+t1.y; } void plane(point t1,point t2) { int top=1; for(int i=1;i<m;i++) { if(dblcmp(crossleft(t1,t2,t[i]))>0) t[top++]=t[i]; if(dblcmp(crossleft(t1,t2,t[i]))*dblcmp(crossleft(t1,t2,t[i+1]))<=0) t[top++]=intersection(t1,t2,t[i],t[i+1]); } if(top==1) m=0; else if(top>3) { t[top]=t[1]; m=top; } else m=top-1; } int main() { // freopen("1.txt","r",stdin); while(scanf("%d",&n)!=EOF&&n) { for(int i=1;i<=n;i++) scanf("%lf %lf",&p[i].x,&p[i].y); p[++n]=p[1]; double top,rear,s; rear=0.000000; top=10000.0000000; while(rear<top) { for(int i=1;i<=n;i++) t[i]=p[i]; point t1,t2; m=n; s=(rear+top)/2; if(rear==s||top==s) { printf("%.6lf/n",s); break; } for(int i=1;i<n;i++) { translation(p[i],p[i+1],s,t1,t2); plane(t1,t2); if(m==0) { top=s; break; } } if(m==1||m==2) { printf("%.6lf/n",s); break; } else if(m>2) rear=s; } } return 0; }