搜索资源列表
B样条曲线反求_OpenGL环境--数据点加入输出点列
- 自己编的三次非均匀B样条曲线反求:给定数据点列,反求控制点,节点向量,按照给定精度,等分参数区间,离散B样条曲线,输出离散点列,模拟真实曲线.此算法包括德布尔-考格斯算法,节点向量算法,反求控制点,以及节点插入技术.对搞图形学的朋友比较有参考作用.-own series of the three non-uniform B-spline curves Reverse : Given a data set, reverse control, vector nodes, according to a
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
Delaunay-Trianglation-Mesh-Generation
- 这也是一个delaunay三角网的程序，功能是我见到最强大的。能生成二维和三维，并有openGl创建模拟三维图。原程序中编译时需要wx/的文件，我没有找到。不过不影响程序的学习.希望对你有用！！包中有.exe可先-This is a triangular network nodes procedures, I see the function is the most powerful. Can generate two-dimensional and three-dimensional, and
VB--Delaunay
- delaunay图形大家再熟悉不过了,用VB编写的生成方法大家可以参考一下-nodes graphics everyone familiar, with VB prepared by the method of generation we can take a look
ring
- 使用VRML的extrution节点和教本编写的画环扩展节点-use VRML extrution nodes and textbook prepared by the Central painting expansion joints
quickbag
- 快速求解离散点集的最小闭包，用于构建delaunay三角形中-discrete point set the minimum closure, used to build nodes Triangle
searchnearestPoint
- 搜寻与地图上指定点最近的道路节点，此源码需调用MapXtreme组件相关功能-search and maps designated points recent road nodes, need to call this source components related functional MapXtreme
xiboshenjingwangluo
- 小波神经网络,输出节点数为:J个；输入节点数为：I个-wavelet neural network, the output nodes : J; Input nodes : I -
Douglas-Poiker_algorithm
- Douglas-Poiker抽稀算法（又称道格拉斯车抽稀），用于二维图形节点抽稀.-Douglas-Poiker pumped dilute algorithm (also known as Douglas cars pumping diluted), 2D graphics for pumping dilute nodes.
Susan_Edge_Detection_Algorithm_Code
- Susan图像边缘检测算法，定位准确，对多个区域的结点也能精确检测。-Susan Edge Detection Algorithm, accurate positioning of a number of regional nodes can be accurately detected.
source
- snake算法源代码。Notes : This snake implementation is based on a doubly linked list * with SnakePoints for nodes. This list knows how to slither * (i.e. minimize the snake energy by moving points), draw * itself using OpenGL, and return useful
Huffman
- 迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set
RTreeTemplate.zip
- R树，具有搜索，添加，删除节点能，利用R树，可以为空间搜索速度带来很大的提升，是GIS中必备的一种算法,R tree, with the search, add, delete nodes can use R trees, you can search for the space a great deal of speed upgrade is necessary for GIS in an algorithm
JDSM.rar
- vrml的节点说明以及每个节点的变量说明，供学习vrml的人参考。,vrml nodes, as well as the variables for each node, for the study of vrml reference.
testPNN
- /*模式训练*/ Training(int,int,int,char*,char*,char*) 参数： 模式个数（即网络的第一隐层节点数） 模式维数（即网络的输入层节点数） 模式类别数(即网络的输出层节点数) 计算中心控制矢量时所用的变换函数核 第二隐层权值的训练算法 训练模式所在的文件名称 /*模式分类*/ Classifying(int,char*) 参数： 需要分类的模式个数 分类数据-/* Model Training*/Tr
htmlib7_860
- HTM（Hierarchical Temporal Memory）技术是利用模拟大脑来实现识别的一种方法，nupic公司有开源实现，上面的htmlib包是另一种实现，适合VC++开发，容易集成-Hierarchical Temporal Memory: What s In a Name? The name was chosen for a reason: Hierarchical-- HTMs are organized as a tree-shaped hierarchy of
BodyPartRecognition
- 微软Kinect识别人体，分离人体部位，并计算得出人体骨骼节点的原理。对于学习Kinect编程的人非常有用。-Microsoft Kinect identify the body, separation of body parts, and calculated the principles of the human skeleton nodes. Kinect for learning programming are very useful.
fractaltree
- 使用Python绘制的树木源码，主要原理为使用分形画树干、树枝，最终叶节点上画上绿色圆圈代表树叶。 -Drawn using the Python source tree, the main principles for the use of fractal art stem, branch, leaf nodes and draw the final green circles represent leaves.
VRML
- 学习vrml的教程 十分的好 有各种节点的描述和学习十分详细-Vrml tutorials to learn quite a good descr iption of a variety of nodes and very detailed study
Network_Drawer.m
- THis function make and plot a random network with N nodes input N: number of nodes r: radius of adjacency s = [s1 s2] is the coordinates of the rectangular in which the nodes are spread output adj_mat: adjacency matrix Lap_ma