搜索资源列表
ConvexHull
- 使用C++实现的基于OpenGl的Graham扫描法求解二维凸包问题-Using c++ implementation based on OpenGl Graham scan method to solve the two dimensional convex hull problem
convex_hull
- 凸包问题的算法实现,graham算法实现,分治算法以及暴力算法,有简单图形界面-Convex Hull algorithm problem, graham algorithm, divide and conquer algorithms and violence algorithm, a simple graphical interface
elementordering
- Graham算法,对形成不规则三角网的最小凸包点进行寻找,并形成最小凸闭包-Graham algorithm, the minimum convex hull point to form a triangular irregular network was looking to form a minimum convex closure
fenzhi
- 凸包求解算法。 实现基于枚举方法的凸包求解算法 实现基于Graham-Scan的凸包求解算法 实现基于分治思想的凸包求解算法 对比三种凸包求解算法 -Convex hull algorithm. Based on Convex Hull algorithm enumeration method Based on Graham-Scan convex hull algorithm Based on Divi
Convex-hull-test-base
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法-The most common convex hull convex hull algorithms Graham Jarvis stepping and scanning method
JAVA
- Project Descr iption nBayes (based on Paul Graham's spam filter) makes it easy to introduce statistics based decision using JAVA
46219700
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法 本程序用Graham扫描法实现凸包的绘制()
34874711
- 凸包最常用的凸包算法是Graham扫描法和Jarvis步进法 本程序用Graham扫描法实现凸包的绘制()
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.)