搜索资源列表
grahams-scan
- 此为凸包的graham的scan算法,思路清晰,易实现。-This is the convex hull of graham scan algorithm, the idea is clear and easy to implement.
TTestMinvexCoh
- 求点集的最小凸包Graham算法。给定平面上的一个点集,找出一个最小点集顺次连结形成一个个凸多边形,使得点集中的点皆在此多边形内或此多边形上,这个凸多边形就是给定点集的二维凸包。 -Demand point set minimum the convex hull Graham algorithm. Given a set of points in the plane, to identify a minimal set of points sequential links forming a
tubao
- 用graham算法在vc环境下编写的形成一个最小凸包程序,能够读入一个点文件,并输出一个点文件。-A minimum convex hull program written using the the graham algorithm in vc environment can be read into a point file and output a point file.
dec96
- 国外游戏开发者杂志1996年第十二期配套代码,包含了Greg Graham的关于DirectSound3D的例子代码-Code of game development magazine in 1996 12th issue, it including Greg Graham example code about DirectSound3D
grahams
- Graham Scan to generic convexha-Graham Scan to generic convexhall
sanwei-mofang-
- 普通玩法 这类玩法适合拿魔方当作放松和娱乐的爱好者。他们通常仅仅满足于复原一个魔方,不会追求更高的标准。一般按照网上的视频教程七个步骤就可以还原,简单易学。 45岁的英国建筑工人格雷厄姆·帕克就花费了26年还原一个魔方。 竞速玩法 竞速玩法出现的具体的时间已经难以考证。当爱好者们已经能够熟练复原魔方的时候,就开始追求最快的复原。竞速复原有几个要点:使用的方法要最简便,但是随之产生的问题是步骤越少,需要记忆的公式就越多;使用的魔方需要最适合竞速使用,不会卡住或者打滑,所以出现了为魔
graham
- 用matlab求二维凸包,并求出二维凸包的面积-Using matlab to calculate the two-dimensional convex hull, and find the two-dimensional convex hull area
GrahamFCH
- 本代码主要实现土包问题的算法,采用Graham扫描算法,随机生成指定数量的点,求解其凸包。代码中包含注释-The code of the main problems of soil packet algorithm, using Graham scan algorithm to randomly generate a specified number of points, solving its convex hull. Code contains annotations
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 Divide and Conquer convex hull alg
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.)