POJ2007 Scrambled Polygon 凸多边形顶点输出
来源:互联网 发布:熊猫tv怎么刷猫币淘宝 编辑:程序博客网 时间:2024/05/16 17:22
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.
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 070 -5060 30-30 -5080 2050 -6090 -20-30 -40-10 -6090 10
Sample Output
(0,0)(-30,-40)(-30,-50)(-10,-60)(50,-60)(70,-50)(90,-20)(90,10)(80,20)(60,30)
Source
Rocky Mountain 2004
用叉积排序即可。
#include <iostream>#include <cstdio>#include <map>#include <set>#include <vector>#include <queue>#include <stack>#include <cmath>#include <algorithm>#include <cstring>#include <string>using namespace std;#define INF 0x3f3f3f3ftypedef long long LL;struct CVector{ int x,y; CVector(int xx,int yy):x(xx),y(yy){} CVector(){} int operator ^ (const CVector &p) const{ return p.y*x-p.x*y; }}point[60];CVector operator - (CVector p,CVector q){ return CVector(p.x-q.x,p.y-q.y);}bool operator < (const CVector &p, const CVector &q){ return (CVector(q-CVector(0,0))^CVector(p-CVector(0,0)))>0;}int main(){ int n=0; while (~scanf("%d%d",&point[n].x,&point[n].y)){ n++; } sort(point+1,point+n); printf("(0,0)\n"); for(int i=n-1;i>0;i--){ printf("(%d,%d)\n",point[i].x,point[i].y); } return 0;}
0 0
- POJ2007 Scrambled Polygon 凸多边形顶点输出
- poj 2007 Scrambled Polygon(凸多边形顶点输出)
- POJ2007 Scrambled Polygon
- POJ2007 Scrambled Polygon
- POJ2007-Scrambled Polygon
- POJ2007--Scrambled Polygon
- POJ2007 Scrambled Polygon
- POJ2007 Scrambled Polygon
- Scrambled Polygon(poj2007极角排序输出凸包)
- poj2007——Scrambled Polygon
- [POJ2007]Scrambled Polygon(计算几何)
- poj2007 Scrambled Polygon【极角排序】
- poj2007-Scrambled Polygon (极角排序)
- ACM-计算几何之Scrambled Polygon——poj2007
- poj2007 Scrambled Polygon (叉积极角排序)
- POJ 2007 || Scrambled Polygon(逆时针输出凸包顶点,以原点为起始点
- Scrambled Polygon
- POJ 2007 Scrambled Polygon 凸包点排序逆时针输出
- nyoj722数独
- linux内核中的文件描述符(一)--基础知识简介
- SourceTree团队git项目工具入门(精简版)
- 2016长乐夏令营 Day12
- 垂直居中问题
- POJ2007 Scrambled Polygon 凸多边形顶点输出
- AB 模拟测试秒杀
- 进制转换,计算 还有各种数据类型和字符
- hdu4632(区间dp+容斥)
- mashenday03
- 实习小记一:RESTful架构理解入门
- 关于 inverse_of 的困惑与探究
- Minimum Path Sum
- QGroupBox QToolBox QComboBox