计算几何基础
bootdubbo
这个作者很懒,什么都没留下…
展开
-
I. Ideal Pyramid
Every pharaoh cares about his legacy. Reigning pharaoh Inaros the Great wants to be remembered for a long time. He is going to build the largest pyramid the humankind has ever seen.Of course, the pro...原创 2019-11-08 18:01:24 · 782 阅读 · 0 评论 -
ZOJ - 2107 Quoit Design【平面最近点对】【分治】
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 position of each toy is ...原创 2019-08-06 14:03:10 · 225 阅读 · 0 评论 -
POJ - 3714 Raid 【点集之间的最近点对】
After successive failures in the battles against the Union, the Empire retreated to its last stronghold. Depending on its powerful defense system, the Empire repelled the six waves of Union’s attack. ...原创 2019-08-06 15:38:15 · 295 阅读 · 0 评论 -
ZOJ - 1450 Minimal Circle 【最小圆覆盖问题】
You are to write a program to find a circle which covers a set of points and has the minimal area. There will be no more than 100 points in one problem.InputThe input contains several problems. The ...原创 2019-08-06 17:06:32 · 183 阅读 · 0 评论 -
HDU - 3007 Buried memory 【最小圆覆盖问题】
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 thing would rather n...原创 2019-08-06 17:15:27 · 156 阅读 · 0 评论 -
HDU - 3272 Mission Impossible
There are A, B, C, D four kinds of resources, A can be obtained at any point in the X-axis. B can be obtained at any point in the Y-axis. C and D each will only be able to achieve at a certain point. ...原创 2019-08-07 10:02:39 · 155 阅读 · 0 评论 -
POJ - 3334 Connected Gheeves 【计算几何+二分】【直线与线段相交求交点】
Gheeves (plural of gheef) are some objects similar to funnels. We define a gheef as a two dimensional object specified by a sequence of points (p1, p2, …, pn) with the following conditions:3 ≤ n ≤ 10...原创 2019-08-07 11:46:24 · 271 阅读 · 0 评论 -
POJ - 1819 Disks
Consider N floating point numbers N representing the radii of N disks. We fix a disk in the xOy system, if we position it at a positive coordinate x (big enough), tangential to the 0x axis and above i...原创 2019-08-07 19:02:15 · 176 阅读 · 0 评论 -
计算几何基础入门详解
我把计算几何分为了六大块一、计算几何基础(点,线,面)二、计算几何凸包三、计算几何圆形四、计算几何旋转卡壳五、计算几何半平面交六、三维计算几何(本博客内容不予介绍)一、计算几何基础1、最开始要提一下的还是精度问题,这在计算几何中可以说非常关键!!!const double eps=1e-8; //我一般都用eps表示,控制在1e-8左右,当然有些题会有它的要求int sgn(d...原创 2019-08-16 13:42:36 · 2188 阅读 · 1 评论 -
POJ - 2284 That Nice Euler Circuit【计算几何+欧拉定理】
Little Joey invented a scrabble machine that he called Euler, after the great mathematician. In his primary school Joey heard about the nice story of how Euler started the study about graphs. The prob...原创 2019-08-17 22:09:51 · 202 阅读 · 0 评论 -
Center
题意:给出n个点,求最少要加入多少个点能使得所有点关于某个中心点对称(中心点不一定是在点集内)#include<bits/stdc++.h>using namespace std;typedef long long ll;#define mp make_pair#define pii pair<int,int>map<pii,int>dot;str...原创 2019-09-08 19:18:35 · 89 阅读 · 0 评论 -
秦皇岛A题
题意:在二维平面上给定n个点,有q个查询,每个查询给出一个点,求这个点与定点能形成多少个直角三角形#include<bits/stdc++.h>using namespace std;#define maxn 2010typedef long long ll;const double eps=1e-8;const double PI=acos(-1.0);int sgn(...原创 2019-09-26 16:42:13 · 139 阅读 · 0 评论 -
求n个点能够组成多少个直角三角形
#include<bits/stdc++.h>using namespace std;#define maxn 2010typedef long long ll;const double eps=1e-8;const double PI=acos(-1.0);int sgn(double x){ if(fabs(x)<eps) return 0; if(x&l...原创 2019-09-26 16:57:52 · 2024 阅读 · 0 评论 -
POJ - 2074 Line of Sight
An architect is very proud of his new home and wants to be sure it can be seen by people passing by his property line along the street. The property contains various trees, shrubs, hedges, and other o...原创 2019-08-06 11:45:34 · 102 阅读 · 0 评论 -
POJ - 1039 Pipe【线段相交】
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 determining how ...原创 2019-08-06 11:11:36 · 154 阅读 · 0 评论 -
POJ - 1654 Area 【叉积】
You are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to the following ...原创 2019-08-07 22:30:53 · 219 阅读 · 0 评论 -
POJ - 1265 Area【pick定理】
Being well known for its highly innovative products, Merck would definitely be a good target for industrial espionage. To protect its brand-new research and development facility the company has instal...原创 2019-08-07 23:15:12 · 133 阅读 · 0 评论 -
POJ - 2318 TOYS 【计算几何】【叉积运用】
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. They gave Joh...原创 2019-08-05 19:08:35 · 272 阅读 · 0 评论 -
POJ - 2398 Toy Storage【计算几何+二分】【叉积运用】
Mom and dad have a problem: their child, Reza, never puts his toys away when he is finished playing with them. They gave Reza a rectangular box to put his toys in. Unfortunately, Reza is rebellious an...原创 2019-08-05 19:15:51 · 157 阅读 · 0 评论 -
POJ - 3304 Segments【计算几何】【线段相交】
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 least one point ...原创 2019-08-05 19:48:05 · 194 阅读 · 0 评论 -
POJ - 1269 Intersecting Lines【线段相交】
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, 2) intersect...原创 2019-08-05 19:56:25 · 148 阅读 · 0 评论 -
The Doors POJ - 1556 【计算几何+最短路径】
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 final points of ...原创 2019-08-05 20:17:27 · 172 阅读 · 0 评论 -
POJ - 2653 Pick-up sticks 【线段相交】
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 there is no ...原创 2019-08-05 22:05:12 · 143 阅读 · 0 评论 -
POJ - 1066 Treasure Hunt 【线段规范相交】
Archeologists from the Antiquities and Curios Museum (ACM) have flown to Egypt to examine the great pyramid of Key-Ops. Using state-of-the-art technology they are able to determine that the lower floo...原创 2019-08-06 00:04:23 · 257 阅读 · 0 评论 -
POJ - 1410 Intersection【线段相交】【简单题】
You are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom:...原创 2019-08-06 08:33:36 · 119 阅读 · 0 评论 -
POJ - 3347 Kadj Squares 【计算几何思维题】
In this problem, you are given a sequence S1, S2, …, Sn of squares of different sizes. The sides of the squares are integer numbers. We locate the squares on the positive x-y quarter of the plane, suc...原创 2019-08-06 10:03:22 · 155 阅读 · 0 评论 -
POJ - 2826 An Easy Problem?!【计算几何】【线段相交】
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 the wall just ...原创 2019-08-06 10:22:17 · 137 阅读 · 0 评论 -
ZOJ - 3862 Intersection 【计算几何+贪心】
Edward has 2n points on the plane conveniently labeled with 1,2,…,2n. Each point is connected exactly with another point by a segment.Edward finds that some segments intersecting with some others. So...原创 2019-08-05 11:34:19 · 163 阅读 · 0 评论