搜索资源列表
graham.zip
- 使用graham算法求二维凸包
graham
- 使用graham算法求二维凸包- Uses the graham algorithm to ask the two-dimensional raised package
ConvexHull1
- 格雷厄姆法求凸壳的C程序-Graham method for convex hull of the C program
mypolygon2
- 8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Fin
2D
- C code for "Computational Geometry in C (Second Edition)": Code function Chapter pointer directory ----------------------------------------------------- Triangulate Chapter 1, Code 1.14 /tri Convex Hull(2D) Chapter 3, C
geometry_algorithm
- 各种关于几何的算法实现。包括 计算几何学库函数（线相交，面积等等） 寻找凸包 graham 扫描法 判断点是否在多边形内。同时包含一些测试-on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment an
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geome
convex_vb
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法.本程序用Graham扫描法实现凸包的绘制-convex hull of the most commonly used convex hull algorithm is scanning and Graham Jarvis stepping law. The procedures used G raham scanning method to achieve the conve
ConvexHull
- 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to gen
DoomsdayDate_demo
- An ingenious yet simple way to calculate the day of the week for any date was invented by John Conway called the Doomsday rule. I highly recommend reading the article by S.W. Graham which fully describes the algorithm
wall
- pku wall graham算法例题解答-pku wall graham algorithm Example answer
Graham_ConvexHull
- 用动态数组法实现求凸壳的程序（格雷厄姆法），可供其它人员参考。-Method using dynamic array of procedures for Convex Hull (Graham Law) for other officers.
convexhull
- The Graham scan examines the points one by one and eliminates the points which cause reflexive angles
Ccode2.tar
- c语言计算几何 三角化 Ch1, Code 1.14 凸形外壳[2D] Ch3, Code 3.8 凸形外壳[3D] Ch4, Code 4.8 球 Chapter 4, Fig. 4.15 德劳内类型 Ch5, Code 5.2 ...See *English version.-\Computational Geometry in C\ the book s recipe Triangulate Chapt
graham
- Graham convex hull sofware
graham
- cnvex hull with algorith graham
Graham
- 应用Graham算法查找散乱点集凸包，该程序演示了2D凸包的查找。按W键随机生成散乱点，并显示查找的最终凸包。-Find the convex of scatter points by graham algorithm. Press w key to generate random points, and the convex will be displayed.
graham
- 构造凸包接口函数,传入原始点集大小n,点集p(p原有顺序被打乱!),返回凸包大小,凸包的点在convex中-Construct convex hull interface function, introduced the original point set size n, the point set p (p the original order has been disrupted!), Returns the size of th
grahams
- Graham Scan Algorithm
graham
- graham algorith wrote in c-graham algorith wrote in c++