![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ACM_计算几何
DATELOST
I'm curious.
展开
-
cf-1142c 求上凸包
题目 #include<iostream> #include<string.h> #include<math.h> #include<stdio.h> #include<algorithm> #include<vector> using namespace std; typedef long long ll; const in...原创 2019-10-25 13:21:16 · 110 阅读 · 0 评论 -
POJ-2600 模拟退火
Description There is a polygon A1A2…An (the vertices Ai are numbered in the clockwise order). On each side AiAi+1 an isosceles triangle AiMiAi+1 is built on the outer side of the polygon, and angle Ai...原创 2019-10-12 19:40:32 · 148 阅读 · 0 评论 -
POJ-1755 半平面交解决 判断不等式组有解
#include<iostream> #include<string.h> #include<math.h> #include<stdio.h> #include<algorithm> #include<vector> using namespace std; const int N=1e3+7; const int maxp...原创 2019-09-16 00:05:55 · 223 阅读 · 0 评论 -
BZOJ-1185 旋转卡壳
Description 给定一些点的坐标,要求求能够覆盖所有点的最小面积的矩形, 输出所求矩形的面积和四个顶点坐标 Input 第一行为一个整数n(3<=n<=50000) 从第2至第n+1行每行有两个浮点数,表示一个顶点的x和y坐标,不用科学计数法 Output 第一行为一个浮点数,表示所求矩形的面积(精确到小数点后5位), 接下来4行每行表示一个顶点坐标,要求第一行为y坐标最小的顶...原创 2019-09-16 00:11:51 · 118 阅读 · 0 评论 -
HDU-3007 最小圆覆盖
Problem Description Each person had do something foolish along with his or her growth.But,when he or she did this that time,they could not predict that this thing is a mistake and they will want this ...原创 2019-09-19 13:17:06 · 204 阅读 · 0 评论 -
cf-1019D 旋转坐标系 二分
D. Large Triangle time limit per test3 seconds memory limit per test256 megabytes inputstandard input outputstandard output There is a strange peculiarity: if you connect the cities of Rostov, Taganro...原创 2019-09-22 19:35:14 · 246 阅读 · 0 评论 -
HDU-6535 计算几何 辛普森积分
Problem Description Chika has just learned about solid geometry! She is very interested in the volume of three-dimensional geometric shapes, so she decides to test you. Before that, she is going to te...原创 2019-09-22 21:01:00 · 286 阅读 · 0 评论 -
P4557 [JSOI2018]战争 闵科夫斯基和
题目 两个凸包A,B,沿某一方向向量移动B,问是否与A有交 两个图形A,B的闵可夫斯基和C={p0+p1|p0∈A,p1∈B} 两个凸包的闵科夫斯基和仍然是凸包 设p0∈A,p1∈B,方向向量V:满足b+V=a 则V=a-b=a+(-b) 则V是一个凸包,且是A,B的闵科夫斯基和 我们先求A,B的闵科夫斯基和C 判断每个向量是否在C中 #include<iostream> #inclu...原创 2019-09-24 15:31:59 · 134 阅读 · 0 评论 -
HDU-6242 随机rand()
Problem Description Alice is interesting in computation geometry problem recently. She found a interesting problem and solved it easily. Now she will give this problem to you : You are given N distinc...原创 2019-09-24 21:07:19 · 135 阅读 · 0 评论 -
HDU-3692 三维几何,二维凸包
Problem Description On the planet Pandora, huge rocks are floating in the sky. Despite the beautiful scenery, these rocks bring some critical problem: they block the sunshine, and shade on the ground....原创 2019-09-26 20:01:25 · 158 阅读 · 0 评论 -
HDU-4449 三维凸包 平面投影 三维坐标转二维坐标 二维凸包
Problem Description You are a notable architect. Recently, a company invites you to design their new building for them. It is not an easy task, because they make some strange claims to the new buildin...原创 2019-09-27 20:40:50 · 313 阅读 · 0 评论 -
POJ-3525 半平面交,二分答案
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 t...原创 2019-09-13 14:52:08 · 157 阅读 · 0 评论 -
POJ-1265 pick定理
题目 给定顶点坐标均是整点(或正方形格点)的简单多边形,皮克定理说明了其面积S和内部格点数目n、边上格点数目s的关系: #include<iostream> #include<string.h> #include<math.h> #include<stdio.h> #include<algorithm> #include<vect...原创 2019-09-13 00:44:00 · 139 阅读 · 0 评论 -
POJ-1873 凸包
Description Once upon a time, in a faraway land, there lived a king. This king owned a small collection of rare and valuable trees, which had been gathered by his ancestors on their travels. To protec...原创 2019-09-12 23:07:47 · 147 阅读 · 0 评论 -
HDU-1007 分治
Problem Description: Have you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded. In the field of Cyberground, the pos...原创 2019-02-07 18:59:09 · 245 阅读 · 0 评论 -
POJ-2318 叉积判断点在直线上下方
Description Calculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with them. T...原创 2019-03-13 23:19:31 · 390 阅读 · 0 评论 -
POJ-3304 判断线段与直线相交
Description Given n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at leas...原创 2019-04-05 17:57:42 · 123 阅读 · 0 评论 -
POJ-2826 求交点与面积
Description It’s raining outside. Farmer Johnson’s bull Ben wants some rain to water his flowers. Ben nails two wooden boards on the wall of his barn. Shown in the pictures below, the two boards on th...原创 2019-04-10 16:36:08 · 163 阅读 · 0 评论 -
POJ-1269 直线交点
Description We all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are parallel, ...原创 2019-04-06 12:29:49 · 98 阅读 · 0 评论 -
POJ-1556 判断相交+dijkstra
Description You are to find the length of the shortest path through a chamber containing obstructing walls. The chamber will always have sides at x = 0, x = 10, y = 0, and y = 10. The initial and fina...原创 2019-04-07 20:47:34 · 98 阅读 · 0 评论 -
POJ-2653 线段相交 排斥跨立实验
Description Stan has n sticks of various length. He throws them one at a time on the floor in a random way. After finishing throwing, Stan tries to find the top sticks, that is these sticks such that ...原创 2019-04-08 15:04:32 · 92 阅读 · 0 评论 -
POJ-1696 Graham_scan求凸包
Description The most exciting space discovery occurred at the end of the 20th century. In 1999, scientists traced down an ant-like creature in the planet Y1999 and called it M11. It has only one eye o...原创 2019-04-09 23:20:57 · 122 阅读 · 0 评论 -
POJ-1039 判断相交计算交点
Description The GX Light Pipeline Company started to prepare bent pipes for the new transgalactic light pipeline. During the design phase of the new pipe shape the company ran into the problem of dete...原创 2019-09-10 20:42:41 · 183 阅读 · 0 评论 -
UVA-12304 测试圆相关模板
题目 kuangbin模板 #include<iostream> #include<string.h> #include<math.h> #include<stdio.h> #include<algorithm> #include<vector> using namespace std; const int N=1e5+7; ...原创 2019-09-11 21:30:11 · 141 阅读 · 0 评论 -
HDU-2036 Shoelace公式计算多边形面积
Input 输入数据包含多个测试实例,每个测试实例占一行,每行的开始是一个整数n(3&amp;lt;=n&amp;lt;=100),它表示多边形的边数(当然也是顶点数),然后是按照逆时针顺序给出的n个顶点的坐标(x1, y1, x2, y2… xn, yn),为了简化问题,这里的所有坐标都用整数表示。 输入数据中所有的整数都在32位整数范围内,n=0表示数据的结束,不做处理。 Output 对于每个测试实例,请输...原创 2019-02-01 13:48:32 · 747 阅读 · 0 评论