搜索资源列表
convex_hull
- 算法分析课程中实现的凸包算法,效率很高,有很大的参考价值-algorithm analysis programs to achieve the convex hull algorithms, highly efficient and have great reference value
2011Convex-optimization-toolbox
- 最新版 斯坦福大学Grant和Boyd教授等开发的凸优化matlab工具箱-Convex optimization toolbox（matlab）by Grant and Boyd in Stanford.Latest version!!2011
1113melkman
- 1113 melkman 凸包算法，O(n),前提是有拓补结构，是一种在线算法-1113 melkman convex hull algorithm, O (n), the premise is expanding premium structure, is an online algorithm
2187
- poj2187给一堆点,求出其中的最远点对,凸包的应用-poj2187 to a pile of points, obtained one of the furthest points right, the application of convex hull
convex2
- Convex constructed uisng Matlab
graham
- Graham convex hull sofware
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
convex
- convex algorithm bodo
tuhanshu
- 详细的介绍了凸函数的一阶范数最优解问题,并且给出一实例-Detailed account of the convex function of the first-order optimal solution norm, and gives an example
uQuadProg
- constrained convex optimization. Using blas data structure.
gaimc-1.0
- 一个常用的计算机图论算法包 包含常用的图论算法 如dijkstra 凸包-A commonly used computer algorithms graph theory package contains the commonly used graph theory algorithms such as convex hull, and so dijkstra
convex
- C++ code. Realization of an algorithm for finding an 2D convex hull polygon for input set of 2D points (with glut).
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
ConvexHull
- In this project, three convex hull algorithms are implemented in java. Three algorithms are Brute Force, Graham’s Scan and Jarvis’ March.
Minimum-area-convex-polygon
- 凸多边形最小面积四边形包围盒算法，是计算最小面积最快的算法。-Minimum area convex polygon quadrilateral bounding box algorithm is the fastest algorithm to calculate the minimum area.
convex-polygon-triangulation
- 给定一系列坐标定点，先判定能否构成凸多边形，然后进行最优三角剖分-Given a series of fixed-point coordinates, first determine whether the composition of convex polygons, then the optimal triangulation
Convex-Optimization_
- 凸优化在数学，计算，通信，航空航天领域有较多的应用，是一个很好的数学工具-convex computer commucation
GA-for-Hv-convex-Images
- Reconstruction of hv-convex binary images from two tomographic projections by genetic algorithm
Convex-optimization
- “凸优化” 是指目标函数为凸函数且由约束条件得到的定义域为凸集的优化问题。文章是MIT的公开课讲义。-"Convex optimization" refers to the objective function is convex function and the constraint conditions are the domain of optimization problem for convex set. Article is MIT public class notes.
cvx-w64
- 计算凸优化问题的matlab程序包，支持64位系统。来自斯坦福大牛Boyd。(CVX is a Matlab-based modeling system for convex optimization. CVX turns Matlab into a modeling language, allowing constraints and objectives to be specified using standard Matlab expression syntax.)