搜索资源列表
chull.zip
- 求三维凸包的程序
graham.zip
- 使用graham算法求二维凸包
matlab凸优化工具包
- 本资源为matlab环境下的凸优化工具包cvx，使用简单方便，内有说明书和例子程序。
geometry-1.5.source.tar
- 一个强大的开源的计算几何算法库，全称是： 提供了诸如：2D凸包，3D凸包，三角化等等著名的计算几何经典算法。库是基于C++的。 -(I plan to dedicate every edition of this software to someone famous who has influenced computers, mathematics, or science.) Version 1.0 of Geometry is dedicated to the father of A
TestMinvexCore
- 求点集的最小凸包Graham算法。给定平面上的一个点集，找出一个最小点集顺次连结形成一个凸多边形，使得点集中的点皆在此多边形内或此多边形上，这个凸多边形就是给定点集的 二维凸包。-The smallest point set for convex hull algorithms Graham. Given a planar point set, find a link to the smallest sequence set to form a convex polygon, the po
ConvexHullScan
- 凸包算法，自己写的代码带了接口，希望大家喜欢.-ConvexHullScan
geometric
- 凸包计算，多边形切割，基本几何公式，球面面积，网格计算，等计算函数。含使用时的注意事项。-Convex hull calculation, polygon cut, basic geometric formulas, spherical area, grid computing, and other computing functions. with cautions .
QuickHulldemo
- 快速凸包演示程序 演示了快速凸包算法的执行过程-Fast convex hull demo program to demonstrate fast convex hull algorithm of the implementation process
chull
- 求三维凸包的程序- Asks the three dimensional raised package the procedure
graham
- 使用graham算法求二维凸包- Uses the graham algorithm to ask the two-dimensional raised package
TSP_G
- 在分离粘连颗粒时通过求取凸包从而得到凸缺，进而找到分离点-Adhesions in the separation of particles through the strike in order to be convex convex hull missing, and then find the separation point
Convex
- 凸包算法 vc 6.0 实现用户输入点凸包-Convex hull algorithm for vc 6.0 user input convex hull
structure
- 数据结构算法大全，包含最短路径，最小生成树，凸包，各种排序，四种高精度运算，图论上的常用算法，以及树的各种算法-data structure ,if you want to learn it well, you need it,I think!
1
- 用C 语言实现的对于凸包问题的求解。实现了基本的功能，代码量很少采用插值算法，先生成四个原始点，之后判断其他点-Using C language for the convex hull of the solution of the problem. To achieve the basic function of the volume of rarely used code interpolation algorithm, the original Mr. into four points, a
Convexhull
- 凸包 凸包问题的实现 有无数点，求能包含这些点的图形的最小面积-Convex hull Convex hull problem of realization there are numerous points, seek to include these points, the graphics, the minimum size
convex
- gram法求凸包， 凸包是区域内任意两点的直线不与边界相交的简单闭区域。 gram算法能够高效地求解出凸包的点集-gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve
Implementation of convex hull
- 实现凸包实现，采用MATLAB编写代码，用于凸包算法的快速实现。(Implementation of convex hull)
Convex hull implementation code
- 使用C语言编程，实现凸包的快速生成，提高了运算的效率。(Using C language programming, realize the rapid generation of convex hull, improve the efficiency of the operation.)
C#
- 计算凸包，最后得到最小凸包。 经过C#的算法快速得到凸包(The algorithm of c # is quickly obtained)
凸优化cvx软件包
- 确定目标函数为凸函数后，对函数进行最优化处理(After determining that the objective function is convex, the function is optimized)