搜索资源列表
geometry_algorithm
- 各种关于几何的算法实现。包括 计算几何学库函数（线相交，面积等等） 寻找凸包 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 co
geometry_c++
- 计算几何学常用算法库 C++语言实现 代码内容 计算几何学常用算法库，包括以下算法： 确定两条线段是否相交 判断点p是否在线段上 判断点q是否在多边形Polygon内 计算多边形的面积 寻找凸包 graham 扫描法 -geometry calculation commonly used algorithm for C language code as calculated geometry commonly used algorithm li
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. Find point set of convex hull vol
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, Code 3.8 /graham Convex Hull(
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 Chapter 1, Code 1.14 /tri Convex
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.
GrahamScan
- Graham凸包扫描算法，算法速度快，很经典的，程序内部注释比较全面。-Graham scan algorithm for convex hull algorithm is fast, very classic, more comprehensive program within the comment.
Enveloppe-convexe-graham
- Graham algorithm Geometry
graham
- Graham s scan algorithm for finding convex hull using linked list.
elementordering
- Graham算法，对形成不规则三角网的最小凸包点进行寻找，并形成最小凸闭包-Graham algorithm, the minimum convex hull point to form a triangular irregular network was looking to form a minimum convex closure
Convex-hull-test-base
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法-The most common convex hull convex hull algorithms Graham Jarvis stepping and scanning method
OpenGL编程指南(原书第8版)中文高清晰版.pdf
- OpenGL 编程指南 ( 原书第 8 版 ) （美）Dave Shreiner Graham Sellers John Kessenich Bill Licea-Kane 著 王锐 等译(OpenGL Programming Guide: The Official Guide to Learning. OpenGL, Version 4.3, Eighth Edition.)