acm aspects of computational geometry ppt, code, etc.. Suitable for students to participate in programming contest

计算几何
........\1066 -- Treasure Hunt.mht
........\1265 -- Area.mht
........\1269 -- Intersecting Lines.mht
........\1410 -- Intersection.mht
........\1556 -- The Doors.mht
........\2010年4月8号用.ppt
........\2318 -- TOYS.mht
........\2398 -- Toy Storage.mht
........\2398.txt
........\2653 -- Pick-up sticks.mht
........\3301 -- Texas Trip.mht
........\3304 -- Segments.mht
........\pku 1066.txt
........\pku 1269.txt
........\pku 1410.txt
........\pku 3301.txt
........\pku 3407.txt
........\pku1265.txt
........\pku1556.txt
........\pku2318.txt
........\pku2653.txt
........\pku3304.txt
........\坐标变换.txt
........\计算几何.ppt
........\计算几何代码
........\............\2528离散化.cpp
........\............\Convex_Hull.cpp
........\............\Geometry.cpp
........\............\HDU1697.cpp
........\............\N点中三个点组成三角形面积最大.cpp
........\............\Pick公式.cpp
........\............\PointIsinPolygon.cpp
........\............\cug_1038_凸包.cpp
........\............\fzu_1014_线段划分多边形.cpp
........\............\fzu_1016_coral.cpp
........\............\fzu_1016_判断一个矩形是否包含另一个矩形.cpp
........\............\fzu_1035_反射.cpp
........\............\fzu_1120_判断一个点是否在多边形内.cpp
........\............\fzu_1302_凸包+Rotating Calipers algorithm.cpp
........\............\fzu_1330_扇形的重心.cpp
........\............\fzu_1331_2多边形的重心.cpp
........\............\fzu_1382.cpp
........\............\fzu_1393_判断N点是否共面.cpp
........\............\hdu_1392_凸包.cpp
........\............\p2403_计算几何.cpp
........\............\p2694_计算几何_枚举剪枝.cpp
........\............\p2710_计算几何_DP.cpp
........\............\p2719_计算几何.cpp
........\............\pku1981_单位圆覆盖最多点(poj1981)CircleandPoints.cpp
........\............\pku2002_3432_N个点最多组成多少个正方形(hao).cpp
........\............\pku2074_线段覆盖.cpp
........\............\pku2187_凸包.cpp
........\............\pku2826_线段围成的区域可储水量.cpp
........\............\pku3277_CityHorizon线段树求N个矩形覆盖的面积(优化).cpp
........\............\pku3668_GameofLine_N个点最多确定多少互不平行的直线(poj3668).cpp
........\............\pku_1106_判断一个点是否在一射线的某侧.cpp
........\............\pku_1118_共线最多的点的个数.cpp
........\............\pku_1151_矩形相交的面积.cpp
........\............\pku_1265_多边形面积+Pick公式的应用.cpp
........\............\pku_1269_两直线的位置关系+平行线的距离.cpp
........\............\pku_1279_简单多边形的核_直线划分多边形_半平面交.cpp
........\............\pku_1314_枚举.cpp
........\............\pku_1329_三角形的外接圆.cpp
........\............\pku_1375_线段重叠+投影.cpp
........\............\pku_1389_矩形相交.cpp
........\............\pku_1556_线段相交+Dijkstra.cpp
........\............\pku_1654_多边形面积.cpp
........\............\pku_1687_图的外轮廓.cpp
........\............\pku_1873_暴力+凸包.cpp
........\............\pku_2600_二分+圆的参数方程.cpp
........\............\pku_2954_Pick公式.cpp
........\............\pku_3130_判断多边形的核是否存在.cpp
........\............\pku_3335.cpp
........\............\pku_3335_判断多边形的核是否存在.cpp
........\............\pku_3407_根据经度纬度求球面距离.cpp
........\............\p点关于直线L的对称点.cpp
........\............\usaco3.4_fence4_线段与三角形的交.cpp
........\............\zju_2419.cpp
........\............\三角形外接圆+圆的参数方程.cpp
........\............\三角形的内接圆(未检验正确性).cpp
........\............\三角形的外接圆.cpp
........\............\三角形的外接圆pku_2504.cpp
........\............\三角形的面积公式.cpp
........\............\二分+圆的参数方程.cpp
........\............\共线最多的点的个数.cpp
........\............\凸包.cpp
........\............\凸包标程.cpp
........\............\切线交点.cpp
........\............\判断N点是否共面.cpp
........\............\判断一个点是否在多边形内.cpp
........\............\判断一个矩形是否包含另一个矩形.cpp
........\............\判断点是否在多边形内_标准.cpp
........\............\判断点是否在线段上.cpp
........\............\判断线段是否有交点并求交点.cpp
........\............\判断线

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．