几何
AI蜗牛之家
北航烟酒僧~ 百度、腾讯自然语言处理算法工程师~
展开
-
判断两条线段是否相交
给定两个点:typedef struct { double x, y;} Point;Point A1,A2,B1,B2;首先引入两个实验:a.快速排斥实验设以线段A1A2和线段B1B2为对角线的矩形为M,N;若M,N 不相交,则两个线段显然不相交;所以:满足第一个条件时:两个线段可能相交。 b.跨立实验转载 2014-09-21 13:42:13 · 2480 阅读 · 0 评论 -
HDU 5978 Convex(几何水题)
ConvexTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 683 Accepted Submission(s): 449Problem DescriptionWe have a special con原创 2017-05-04 10:41:37 · 1398 阅读 · 0 评论 -
第三届山东省ACM Fruit Ninja II
#include #include #include using namespace std; int main() { int T; scanf("%d",&T); int i; for(i=1;i<=T;i++) { int a,b,h; scanf("%d%d%原创 2016-05-04 15:11:29 · 917 阅读 · 0 评论 -
POJ 1039 Pipe(直线相交)
PipeTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1039DescriptionThe GX Light Pipeline Company started to prepare bent原创 2016-05-18 21:59:26 · 840 阅读 · 0 评论 -
极角排序
这里讲了几种极角排序方法,http://www.csie.ntnu.edu.tw/~u91029/PointLinePlane2.html,我这里只说下atan2还有象限排序。因为纯粹叉积是不能排360度的,所以需要改一些东西。atan2是按向量排序的,这个很好啊,可是就是可能会伤精度,那么会死很惨的,虽然我还没遇到用atan2伤精度的题~atan2的参数是向量的y坐标,x原创 2016-05-18 21:22:23 · 836 阅读 · 0 评论 -
POJ 1696 Space Ant(极角排序)
Space AntTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1696DescriptionThe most exciting space discovery occurred at the e原创 2016-05-18 21:18:36 · 878 阅读 · 0 评论 -
POJ 1410 Intersection(判断线段交 点在多边形内)
IntersectionTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1410DescriptionYou are to write a program that has to decide wh原创 2016-05-18 19:25:12 · 993 阅读 · 0 评论 -
POJ 1066 Treasure Hunt(转化线段相交)
Treasure HuntTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1066DescriptionArcheologists from the Antiquities and Curios原创 2016-05-17 19:59:57 · 873 阅读 · 0 评论 -
Pick-up sticks(线段相交判断)
Pick-up sticksTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2653DescriptionStan has n sticks of various length. He throws原创 2016-05-17 19:19:40 · 914 阅读 · 0 评论 -
POJ 1556 The Doors(点到线段的距离+最短路)
The DoorsTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1556DescriptionYou are to find the length of the shortest path t原创 2016-05-16 22:10:25 · 953 阅读 · 0 评论 -
POJ 1269 Intersecting Lines(判断两条线段关系)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13579 Accepted: 6040DescriptionWe all know that a pair of distinct points on a plane原创 2016-05-16 21:47:52 · 844 阅读 · 0 评论 -
POJ 3304 Segments(判断直线和线段相交)
SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12150 Accepted: 3845DescriptionGiven n segments in the two dimensional space, write a program,原创 2016-05-16 21:44:47 · 840 阅读 · 0 评论 -
三分查找
一 问题在一个平面上有N个点,每个点的坐标已经给出,现在要求在X轴上找一个点,使得这个点到所有点中最大的距离最小。二 分析不知道是否有基于策略选择的算法,也许是DP也许是Greedy。本文通过数值计算来解决此问题。问题抽象:设f(x) = max(node1_distance, node2_distance, ……nodeN_distance), a原创 2016-05-16 21:33:00 · 806 阅读 · 0 评论 -
几何基础知识点
原博地址:http://dev.gameres.com/Program/Abstract/Geometry.htm#矢量叉积怒火之袍 计算几何算法概览一、引言 计算机的出现使得很多原本十分繁琐的工作得以大幅度简化,但是也有一些在人们直观看来很原创 2016-05-16 20:40:50 · 3415 阅读 · 0 评论 -
POJ 2318 TOYS
TOYSTime Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2318DescriptionCalculate the number of toys that land in each bin of原创 2016-05-16 20:38:02 · 810 阅读 · 0 评论 -
BC之Run
Problem DescriptionAFA is a girl who like runing.Today,he download an app about runing .The app can record the trace of her runing.AFA will start runing in the park.There are many chairs in the park,原创 2015-08-09 13:18:34 · 1024 阅读 · 0 评论 -
折线分割平面
题目很简单,但是感觉分析过程挺重要的,有点经典。http://acm.hdu.edu.cn/showproblem.php?pid=2050Problem Description我们看到过很多直线分割平面的题目,今天的这个题目稍微有些变化,我们要求的是n条折线分割平面的最大数目。比如,一条折线可以将平面分成两部分,两条折线最多可以将平面分成7部分,具体如下所示。转载 2015-02-04 23:27:27 · 967 阅读 · 0 评论 -
The 2016 ACM-ICPC Asia Dalian Regional Contest(汇总)
题解链接 ProblemRank (05:00:00)0 CommentsSettingFavoriteClone Stat#OriginTitlehere222 / 700AHDU 5971Wrestling Match原创 2017-05-04 10:45:57 · 2064 阅读 · 0 评论