![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
计算几何
文章平均质量分 84
Misdom_Tian_Ya
这个作者很懒,什么都没留下…
展开
-
HDU 1007 Quoit Design
Problem DescriptionHave you ever played quoit in a playground? Quoit is agame in which flat rings are pitched at some toys, with all the toys encircledawarded.In the field of Cyberground, the posi原创 2015-04-24 10:30:48 · 444 阅读 · 0 评论 -
POJ 3525 Most Distant Point from the Sea (banpingmianjiao)
DescriptionThe 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原创 2015-05-01 18:21:59 · 422 阅读 · 0 评论 -
第四届 Rescue The Princess
DescriptionSeveral days ago, a beast caught a beautiful princess and the princess was put in prison. To rescue the princess, a prince who wanted to marry the princess set out immediately. Yet, the be原创 2015-05-05 18:35:15 · 480 阅读 · 0 评论 -
UVA 11168 Airport
There is a small town with n houses. The town needs an airport. An airport is basically a very long, very straight road. Think of it as an infinite line. We need to build the airport such that the a原创 2015-05-01 09:56:59 · 408 阅读 · 0 评论 -
UVA 10256 The Great Divide
判断由红点和蓝点分别组成的两个凸包是否相离,是输出Yes,否输出No。训练指南上的分析:1.任取红凸包上的一条线段和蓝凸包上的一条线段,判断二者是否相交。如果相交(不一定是规范相交,有公共点就算相交),则无解2.任取一个红点,判断是否在蓝凸包内。如果是,则无解。蓝点红凸包同理。其中任何一个凸包退化成点或者线段时需要特判。其实只需要把上面两个判断顺序颠倒一下,就可以不需要特判。原创 2015-05-01 11:00:31 · 438 阅读 · 0 评论 -
UVA 10652 Board Wrapping (凸包面积)
InputOn the first line of input there is one integer, N <= 50, giving the number of test cases (moulds) in the input. After this line, N test cases follow. Each test case starts with a line contai原创 2015-05-01 09:02:00 · 385 阅读 · 0 评论 -
POJ 1418 Viva Confetti
DescriptionDo you know confetti? They are small discs of colored paper, and people throw them around during parties or festivals. Since people throw lots of confetti, they may end up stacked one原创 2015-04-29 16:29:28 · 494 阅读 · 0 评论 -
UVA 12304 2D Geometry 110 in 1!(计算几何)
This is a collection of 110 (in binary) 2D geometry problems.CircumscribedCircle x1 y1 x2 y2 x3 y3Find out the circumscribed circle of triangle (x1,y1)-(x2,y2)-(x3,y3). These three points are gu原创 2015-04-28 10:33:31 · 438 阅读 · 0 评论 -
POJ 2284 That Nice Euler Circuit (欧拉定理)
DescriptionLittle 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 g原创 2015-04-25 19:41:40 · 511 阅读 · 0 评论 -
UVA 11178 Morley’s Theorem(计算几何直线的交点)
Morley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of ang原创 2015-04-25 18:41:21 · 397 阅读 · 0 评论 -
UVA 11796 Dog Distance
#include #include #include using namespace std;double Min,Max;struct Point{ double x,y; Point(){} Point(double x,double y):x(x),y(y){}};Point operator+(Point A,Point原创 2015-04-25 21:09:21 · 506 阅读 · 0 评论 -
HDU 4720 Naive and Silly Muggles
DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which covers those three wizards, in other words, all of the原创 2015-05-07 15:26:08 · 381 阅读 · 0 评论