Scrambled Polygon

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 9646		Accepted: 4558

Description

A closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are called the vertices of the polygon. When one starts at any vertex of a closed polygon and traverses each bounding line segment exactly once, one comes back to the starting vertex. 

A closed polygon is called convex if the line segment joining any two points of the polygon lies in the polygon. Figure 1 shows a closed polygon which is convex and one which is not convex. (Informally, a closed polygon is convex if its border doesn't have any "dents".) 

The subject of this problem is a closed convex polygon in the coordinate plane, one of whose vertices is the origin (x = 0, y = 0). Figure 2 shows an example. Such a polygon will have two properties significant for this problem. 

The first property is that the vertices of the polygon will be confined to three or fewer of the four quadrants of the coordinate plane. In the example shown in Figure 2, none of the vertices are in the second quadrant (where x < 0, y > 0). 

To describe the second property, suppose you "take a trip" around the polygon: start at (0, 0), visit all other vertices exactly once, and arrive at (0, 0). As you visit each vertex (other than (0, 0)), draw the diagonal that connects the current vertex with (0, 0), and calculate the slope of this diagonal. Then, within each quadrant, the slopes of these diagonals will form a decreasing or increasing sequence of numbers, i.e., they will be sorted. Figure 3 illustrates this point. 
 

Input

The input lists the vertices of a closed convex polygon in the plane. The number of lines in the input will be at least three but no more than 50. Each line contains the x and y coordinates of one vertex. Each x and y coordinate is an integer in the range -999..999. The vertex on the first line of the input file will be the origin, i.e., x = 0 and y = 0. Otherwise, the vertices may be in a scrambled order. Except for the origin, no vertex will be on the x-axis or the y-axis. No three vertices are colinear.

Output

The output lists the vertices of the given polygon, one vertex per line. Each vertex from the input appears exactly once in the output. The origin (0,0) is the vertex on the first line of the output. The order of vertices in the output will determine a trip taken along the polygon's border, in the counterclockwise direction. The output format for each vertex is (x,y) as shown below.

Sample Input

0 0
70 -50
60 30
-30 -50
80 20
50 -60
90 -20
-30 -40
-10 -60
90 10

Sample Output

(0,0)
(-30,-40)
(-30,-50)
(-10,-60)
(50,-60)
(70,-50)
(90,-20)
(90,10)
(80,20)

(60,30)

输入的第一个点始终是（0，0），从（0，0）开始逆时针输出所有点

一、叉积

叉积的计算是线段方法的核心。对于向量p1和p2，叉积是由点(0,0)、p1、p2和p1+p2构成的平行四边形的有向面积。另一种与之等价但更有效的的叉积定义方式是将其看做矩阵行列式：

p1×p2 = x1y2 - x2y1 = - p2×p1

若p1×p2为正，则相对于原点(0,0)来说，p1位于p2顺时针方向；若p1×p2为负，p1位于p2逆时针方向；若为0则方向相同，或相反。

 

若是相对于点p0(x0,y0)而非原点，则p0p1和p0p2的叉积为(p1-p0)×(p2-p0) = (x1-x0)(y2-y0)-(x2-x0)(y1-y0)。

 

确定连续线段是向左转还是向右转

对于线段p0p1和p1p2，采用叉积可以避免计算角度，只需简单的计算一下p0p2是位于p0p1的顺时针还是逆时针方向。计算叉积

(p2-p0)×(p1-p0) = (x2-x0)(y1-y0) - (x1-x0)(y2-y0)

若结果为负，p0p2在p0p1的逆时针方向，在p1处左转；结果为正则右转；为0表示三点共线。

 

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
    double x;
    double y;
}p[100];
//求叉积 返回结果为正说明C在向量AB的左边（三点构成逆时针方向）；为负则相反 等0在一条线上  
double multi(node A,node B,node C)
{
    return (B.x-A.x)*(C.y-A.y)-(C.x-A.x)*(B.y-A.y);
}
double len(node A,node B)
{
    return sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));
}
//逆时针排序 
bool cmp(node A,node B)
{
    double pp=multi(p[0],A,B);
    if(pp>0) return true;
    if(pp<0) return false;
   return len(p[0],A)<len(p[0],B);
}
int main()
{
    int n=0;
    while(~scanf("%lf%lf",&p[n].x,&p[n].y)) n++;
    sort(p+1,p+n,cmp);
    for(int i=0;i<n;i++)
    cout<<"("<<p[i].x<<","<<p[i].y<<")"<<endl;
}