计算几何基础
文章平均质量分 86
Sitlos
有梦为马,随处可栖。
展开
-
计算几何模板
#include using namespace std;#define EPS 1e-10double add(double a,double b){ if(abs(a+b) return a+b;}struct P{ double x,y; P(){} P(double x,double y): x(x),y原创 2017-03-13 21:55:28 · 504 阅读 · 0 评论 -
POJ 2653 Pick-up sticks(判断线段相交)
Pick-up sticksTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 13161 Accepted: 4947DescriptionStan has n sticks of various length. He throws them one at原创 2017-06-28 21:38:09 · 628 阅读 · 0 评论 -
POJ 1066 Treasure Hunt(线段相交判断)
Treasure HuntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7040 Accepted: 2907DescriptionArcheologists from the Antiquities and Curios Museum (ACM) ha原创 2017-06-28 21:41:41 · 322 阅读 · 0 评论 -
POJ 1410 Intersection(判断线段交和点在矩形内)
IntersectionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14773 Accepted: 3872DescriptionYou are to write a program that has to decide whether a given原创 2017-06-28 21:45:05 · 290 阅读 · 0 评论 -
POJ 1696 Space Ant(极角排序)
Space AntTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4460 Accepted: 2804DescriptionThe most exciting space discovery occurred at the end of the 20th原创 2017-06-28 21:48:29 · 302 阅读 · 0 评论 -
POJ 1556 The Doors(线段交+最短路)
The DoorsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8639 Accepted: 3310DescriptionYou are to find the length of the shortest path through a chamber原创 2017-06-28 21:34:23 · 390 阅读 · 0 评论 -
POJ 1269 Intersecting Lines(直线相交判断,求交点)
Intersecting LinesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15911 Accepted: 6904DescriptionWe all know that a pair of distinct points on a plane d原创 2017-06-28 21:29:08 · 331 阅读 · 0 评论 -
POJ 3304 Segments (直线和线段相交判断)
SegmentsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14264 Accepted: 4546DescriptionGiven n segments in the two dimensional space, write a program, w原创 2017-06-28 21:23:11 · 422 阅读 · 0 评论 -
POJ 1066 Treasure Hunt(线段相交判断)
TOYSTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 15175 Accepted: 7320DescriptionCalculate the number of toys that land in each bin of a partitioned t原创 2017-06-27 11:40:51 · 296 阅读 · 0 评论 -
POJ 2398 Toy Storage(计算几何,叉积判断点和线段的关系)
Toy StorageTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5668 Accepted: 3378DescriptionMom and dad have a problem: their child, Reza, never puts his t原创 2017-06-28 20:32:15 · 321 阅读 · 0 评论 -
ZOJ 1199 Point of Intersection(平面几何)
Point of IntersectionTime Limit: 2 Seconds Memory Limit: 65536 KBGiven two circles on the same plane which are centered at (x1,y1) and (x2,y2) ,with radiuses r1 and r2, respectively.We原创 2017-04-21 15:57:55 · 474 阅读 · 0 评论