搜索资源列表
matlab凸优化工具包
- 本资源为matlab环境下的凸优化工具包cvx，使用简单方便，内有说明书和例子程序。
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
Hull
- 凸包算法实现三角网的构建 Convex hull of the triangulation algorithm to build-Convex hull triangulation algorithm to build the Convex hull of the triangulation algorithm to build
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
Convex_hullAlgorithm
- 实用的凸包算法，包括计算点与水平线的夹角，二分法排序，找极点等。-A practical convex hull algorithm, including calculating angle of the point and horizontal line, dichotomy sort, looking for poles and so on.
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
area
- 计算凸包面积，点集Q的凸包是指一个最小凸多边形，满足Q中的点或者在多边形边上或者在其内。-Calculate convex hull area。The convex hull of point set Q is a minimum convex polygon, to meet the Q of the point or polygon or in its inside edge
ConvHull2D
- 计算几何中的凸包求解算法，效率比较高，并且容易使用，直接调用即可-computing geometry to compute the convex of a set of points.
HH_GIS_SpAn
- GIS空间分析工具，我们的空间分析课程设计包含道格拉斯抽样、曲线插值与光滑、多边形最小凸包、点群分布参数（分布中心、分布密度、分布轴线等）。基本功能都实现了。-GIS spatial analysis tools, our curriculum includes Douglas spatial analysis sampling, interpolation and smooth curve, the minimum convex polygon, point group distributio
Minimum_PointSet
- 一个用于生成多边形最小凸包的简单程序，基本功能就是用鼠标随意画一个多边形，然后计算并生成多边形最小凸包。很难得-Minimum convex polygon of a package used to generate a simple procedure, the basic function is free to draw a polygon with the mouse, and then calculates and generates the smallest convex polygo
3DTuBao
- 三维凸包演示，用的是增量法，复试度o(n^2)-Three-dimensional convex hull demo, use the incremental method, the second interview degrees o (n ^ 2)
my_tubao
- Csharp凸包生成程序，自己做的，大家可以拿去用用看看，有什么改进意见，咱们可以讨论，我的邮箱feiyuno2@163.com-Csharp convex hull generator, own, and we can take it with a used look, what improvements, we can discuss, my mailbox feiyuno2@163.com
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.)
semi_convex_hull
- 凸包算法，选取区域最外围点，用于感兴趣区域提取。(Convex hull algorithm is used to extract regions of interest.)
ConvexHull
- 凸包(ConvexHull)就是把给定点包围在内部的，面积最小的凸多边形。时间复杂度为O(n)先计算凸包，输入点数组p，点个数为n，输出点数组ch。函数返回凸包顶点数。(The convex hull (ConvexHull) is the smallest convex polygon that surrounds the point to its interior. The time complexity is O (n). First, the convex hull is compute
C#
- 计算凸包，最后得到最小凸包。 经过C#的算法快速得到凸包(The algorithm of c # is quickly obtained)
DEM两种凸包算法程序 C# .NET
- c#下的dem内插，凸包，界面简单，语言简单，可以运行(C# DEM Interpolation, convex hull, simple interface, simple language, and can run.)
凸优化cvx软件包
- 确定目标函数为凸函数后，对函数进行最优化处理(After determining that the objective function is convex, the function is optimized)