Search - graham

Search - graham - List

[Mathimatics-Numerical algorithms] graham.zip DL : 0: 使用graham算法求二维凸包
Update : 2025-02-17 Size : 3.84kb Publisher :
[Mathimatics-Numerical algorithms] graham DL : 0: 使用graham算法求二维凸包- Uses the graham algorithm to ask the two-dimensional raised package
Update : 2025-02-17 Size : 4kb Publisher : 站长
[Graph program] ConvexHull1 DL : 0: 格雷厄姆法求凸壳的C程序-Graham method for convex hull of the C program
Update : 2025-02-17 Size : 1kb Publisher : 杜斐
[Special Effects] mypolygon2 DL : 0: 8. 判断点是否在凸多边形内 9. 寻找点集的graham算法 10.寻找点集凸包的卷包裹法 11.判断线段是否在多边形内 12.求简单多边形的重心 13.求凸多边形的重心14.求肯定在给定多边形内的一个点15.求从多边形外一点出发到该多边形的切线16.判断多边形的核是否存在-8. In judging whether a convex polygon 9. Find points of graham algorithm 10. Find point set of convex hull volume parcels Act 11. Line judge whether the polygon 12. Seeking simple polygon focus 13. Convex Polygon focus 14. For sure in a given polygon within the a point 15. demand from outside the polygon to the starting point of the polygon Tangent 16. the nuclear polygon judgment whether there
Update : 2025-02-17 Size : 4kb Publisher : 孤星赶月
[Graph Recognize] 2D DL : 0: 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, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm-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, Code 3.8 /graham Convex Hull(3D) Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Update : 2025-02-17 Size : 66kb Publisher : Mark
[Special Effects] geometry_algorithm DL : 0: 各种关于几何的算法实现。包括计算几何学库函数（线相交，面积等等）寻找凸包 graham 扫描法判断点是否在多边形内。同时包含一些测试-on various geometric algorithm. In terms of geometry library functions (lines intersect, size, etc.) for convex hull graham scanning judgment and whether the polygon. Both contain some tests
Update : 2025-02-17 Size : 12kb Publisher : changxia
[Special Effects] geometry_c++ DL : 0: 计算几何学常用算法库 C++语言实现代码内容计算几何学常用算法库，包括以下算法：确定两条线段是否相交判断点p是否在线段上判断点q是否在多边形Polygon内计算多边形的面积寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm library, include the following algorithm : to determine whether the intersection of two segments to judge whether p-point of judgment, whether the point q Polygon Polygon estimate Polygon area for convex hull graham scanning
Update : 2025-02-17 Size : 12kb Publisher : henry
[Other systems] convex_vb DL : 0: 凸包最常用的凸包算法是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 convex hull mapping
Update : 2025-02-17 Size : 7kb Publisher : gaici
[Algorithm] ConvexHull DL : 0: 使用C++实现的Graham扫描法（求解凸包问题），可设置生成随机点的个数、样式，同时支持设置显示范围、显示算法处理时间及使用文件导入导出点等功能。（文件格式为，头四个字节是点的个数，以后分别是各个点的x坐标和y坐标，每个数值均占4字节）。-The use of C++ Realize the Graham scan method (for solving convex hull problems), can be set to generate a random number of points, patterns, and at the same time to support the set display range, display algorithm processing time and the use of document features such as import and export points. (File format for the first four bytes is the number of points, after all points are x coordinates and y coordinates, each account for 4-byte value).
Update : 2025-02-17 Size : 50kb Publisher : 王晓桐
[GUI Develop] DoomsdayDate_demo DL : 0: 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
Update : 2025-02-17 Size : 10kb Publisher : lg
[Other] wall DL : 0: pku wall graham算法例题解答-pku wall graham algorithm Example answer
Update : 2025-02-17 Size : 1kb Publisher : 张鹏
[Mathimatics-Numerical algorithms] Graham_ConvexHull DL : 0: 用动态数组法实现求凸壳的程序（格雷厄姆法），可供其它人员参考。-Method using dynamic array of procedures for Convex Hull (Graham Law) for other officers.
Update : 2025-02-17 Size : 437kb Publisher : neus
[Other] convexhull DL : 0: The Graham scan examines the points one by one and eliminates the points which cause reflexive angles
Update : 2025-02-17 Size : 2kb Publisher : linru
[Special Effects] Ccode2.tar DL : 0: 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 Chapter 1, Code 1.14 /tri Convex Hull[2D] Chapter 3, Code 3.8 /graham Convex Hull[3D] Chapter 4, Code 4.8 /chull sphere.c Chapter 4, Fig. 4.15 /sphere Delaunay Triang Chapter 5, Code 5.2 /dt SegSegInt Chapter 7, Code 7.2 /segseg Point-in-poly Chapter 7, Code 7.13 /inpoly Point-in-hedron Chapter 7, Code 7.15 /inhedron Int Conv Poly Chapter 7, Code 7.17 /convconv Mink Convolve Chapter 8, Code 8.5 /mink Arm Move Chapter 8, Code 8.7 /arm
Update : 2025-02-17 Size : 56kb Publisher : XJ
[Algorithm] graham DL : 0: Graham convex hull sofware
Update : 2025-02-17 Size : 8kb Publisher : azizul azhar
[Algorithm] graham DL : 0: cnvex hull with algorith graham
Update : 2025-02-17 Size : 3kb Publisher : artavazd
[OpenGL program] Graham DL : 0: 应用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.
Update : 2025-02-17 Size : 471kb Publisher : 张建生
[Multimedia Develop] 0240807006 DL : 0: A Broadcast Engineering Tutorial for Non-Engineers Third Edition by Graham Jones, 2005, Elsevier Inc, ISBN 0-240-80700-6
Update : 2025-02-17 Size : 1.96mb Publisher : Zorrito
[Other] Oxford_Image_Processing_and_Analysis_A_Practical_A DL : 0: djvu电子书：Oxford - Image Processing and Analysis - A Practical Approach (T)(322s)Graham J., Baldock R.(2000)-This volume presents the subject of image processing and analysis to the point of view of the user. The standard algorithms, procedures, and rules of thumb are explained in the context of successful application to biological or medical images and chapters cover image acquisition, processing, analysis, and pattern recognition. This approach equips the user with the necessary background for informed use of image processing software, and the ability to write their own programs. There are explanations of more advanced techniques, and each has reference to specific applications. This is an extremely usable, practical guide for the beginning postgraduate biologist or medical researcher.
Update : 2025-02-17 Size : 3.48mb Publisher : altsu
[Windows Develop] graham DL : 0: graham algorith wrote in c-graham algorith wrote in c++
Update : 2025-02-17 Size : 150kb Publisher : whity19861986

« 12 3 4 5 »